- Subscribe to this page:
- RSS
- Email Alert
AI Access Foundation
(16 results)-
Whitepapers
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
January 1, 2013, 12:00am PST
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represented as constraint...
Provided by AI Access Foundation
-
Whitepapers
The Fast Downward Planning System
January 1, 2013, 12:00am PST
Fast downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including...
Provided by AI Access Foundation
-
Whitepapers
Generative Prior Knowledge for Discriminative Classification
January 1, 2013, 12:00am PST
The authors present a novel framework for integrating prior knowledge into discriminative classifiers. Their framework allows discriminative classifiers such as Support Vector Machines (SVMs) to...
Provided by AI Access Foundation
-
Whitepapers
Properties and Applications of Programs with Monotone and Convex Constraints
January 1, 2013, 12:00am PST
The authors study properties of programs with monotone and convex constraints. They extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Provided by AI Access Foundation
-
Whitepapers
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
January 1, 2013, 12:00am PST
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful...
Provided by AI Access Foundation
-
Whitepapers
Short and Long Supports for Constraint Propagation
January 1, 2013, 12:00am PST
Special-purpose constraint propagation algorithms frequently make implicit use of short supports - by examining a subset of the variables, they can infer support (a justification that a...
Provided by AI Access Foundation
-
Whitepapers
Optimal Rectangle Packing: An Absolute Placement Approach
January 1, 2013, 12:00am PST
The authors consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Their rectangle packer chooses the x-coordinates of...
Provided by AI Access Foundation
-
Whitepapers
Automatic Aggregation by Joint Modeling of Aspects and Values
January 1, 2013, 12:00am PST
The authors present a model for aggregation of product review snippets by joint aspect identification and sentiment analysis. Their model simultaneously identifies an underlying set of ratable...
Provided by AI Access Foundation
-
Whitepapers
Undominated Groves Mechanisms
January 1, 2013, 12:00am PST
The family of Groves mechanisms, which includes the well-known VCG mechanism (also known as the Clarke mechanism) is a family of efficient and strategy-proof mechanisms. Unfortunately, the Groves...
Provided by AI Access Foundation
-
Whitepapers
Generating Extractive Summaries of Scientific Paradigms
February 1, 2013, 12:00am PST
Researchers and scientists increasingly find themselves in the position of having to quickly understand large amounts of technical material. The authors' goal is to effectively serve this need by...
Provided by AI Access Foundation
-
Whitepapers
Integrative Semantic Dependency Parsing via Efficient Large-scale Feature Selection
February 1, 2013, 12:00am PST
Semantic parsing, i.e., the automatic derivation of meaning representation such as an instantiated predicate-argument structure for a sentence, plays a critical role in deep processing of natural...
Provided by AI Access Foundation
-
Whitepapers
Toward Supervised Anomaly Detection
February 1, 2013, 12:00am PST
Anomaly detection is being regarded as an unsupervised learning task as anomalies stem from adversarial or unlikely events with unknown distributions. However, the predictive performance of purely...
Provided by AI Access Foundation
-
Whitepapers
Interactions Between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results
September 1, 2012, 12:00am PDT
While reactive systems (Pnueli, 1977) are traditionally specified using plain temporal logic, there is a well-established tradition in Artificial Intelligence (AI) and, in particular, Multi-Agent...
Provided by AI Access Foundation
-
Whitepapers
The Tractability of CSP Classes Defined by Forbidden Patterns
September 1, 2012, 12:00am PDT
The Constraint Satisfaction Problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent...
Provided by AI Access Foundation
-
Whitepapers
Towards Unsupervised Learning of Temporal Relations Between Events
September 10, 2012, 12:00am PDT
Automatic extraction of temporal relations between event pairs is an important task for several natural language processing applications such as question answering, information extraction and...
Provided by AI Access Foundation
-
White Papers
On the Formal Semantics of Speech-Act Based Communication in an Agent-Oriented Programming Language
October 31, 2011, 12:00am PDT
Research on agent communication languages has typically taken the speech acts paradigm as its starting point. Despite their manifest attractions, speech-act models of communication have several...
Provided by AI Access Foundation
-
Whitepapers
Towards Unsupervised Learning of Temporal Relations Between Events
September 10, 2012, 12:00am PDT
Automatic extraction of temporal relations between event pairs is an important task for several natural language processing applications such as question answering, information extraction and...
Provided by AI Access Foundation
-
Whitepapers
The Tractability of CSP Classes Defined by Forbidden Patterns
September 1, 2012, 12:00am PDT
The Constraint Satisfaction Problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent...
Provided by AI Access Foundation
-
Whitepapers
Interactions Between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results
September 1, 2012, 12:00am PDT
While reactive systems (Pnueli, 1977) are traditionally specified using plain temporal logic, there is a well-established tradition in Artificial Intelligence (AI) and, in particular, Multi-Agent...
Provided by AI Access Foundation
-
Whitepapers
Toward Supervised Anomaly Detection
February 1, 2013, 12:00am PST
Anomaly detection is being regarded as an unsupervised learning task as anomalies stem from adversarial or unlikely events with unknown distributions. However, the predictive performance of purely...
Provided by AI Access Foundation
-
Whitepapers
Integrative Semantic Dependency Parsing via Efficient Large-scale Feature Selection
February 1, 2013, 12:00am PST
Semantic parsing, i.e., the automatic derivation of meaning representation such as an instantiated predicate-argument structure for a sentence, plays a critical role in deep processing of natural...
Provided by AI Access Foundation
-
Whitepapers
Generating Extractive Summaries of Scientific Paradigms
February 1, 2013, 12:00am PST
Researchers and scientists increasingly find themselves in the position of having to quickly understand large amounts of technical material. The authors' goal is to effectively serve this need by...
Provided by AI Access Foundation
-
Whitepapers
Undominated Groves Mechanisms
January 1, 2013, 12:00am PST
The family of Groves mechanisms, which includes the well-known VCG mechanism (also known as the Clarke mechanism) is a family of efficient and strategy-proof mechanisms. Unfortunately, the Groves...
Provided by AI Access Foundation
-
Whitepapers
Automatic Aggregation by Joint Modeling of Aspects and Values
January 1, 2013, 12:00am PST
The authors present a model for aggregation of product review snippets by joint aspect identification and sentiment analysis. Their model simultaneously identifies an underlying set of ratable...
Provided by AI Access Foundation
-
Whitepapers
Optimal Rectangle Packing: An Absolute Placement Approach
January 1, 2013, 12:00am PST
The authors consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Their rectangle packer chooses the x-coordinates of...
Provided by AI Access Foundation
-
Whitepapers
Short and Long Supports for Constraint Propagation
January 1, 2013, 12:00am PST
Special-purpose constraint propagation algorithms frequently make implicit use of short supports - by examining a subset of the variables, they can infer support (a justification that a...
Provided by AI Access Foundation
-
Whitepapers
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
January 1, 2013, 12:00am PST
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful...
Provided by AI Access Foundation
-
Whitepapers
Properties and Applications of Programs with Monotone and Convex Constraints
January 1, 2013, 12:00am PST
The authors study properties of programs with monotone and convex constraints. They extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Provided by AI Access Foundation
-
Whitepapers
Generative Prior Knowledge for Discriminative Classification
January 1, 2013, 12:00am PST
The authors present a novel framework for integrating prior knowledge into discriminative classifiers. Their framework allows discriminative classifiers such as Support Vector Machines (SVMs) to...
Provided by AI Access Foundation
-
Whitepapers
The Fast Downward Planning System
January 1, 2013, 12:00am PST
Fast downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including...
Provided by AI Access Foundation
-
Whitepapers
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
January 1, 2013, 12:00am PST
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represented as constraint...
Provided by AI Access Foundation
-
White Papers
On the Formal Semantics of Speech-Act Based Communication in an Agent-Oriented Programming Language
October 31, 2011, 12:00am PDT
Research on agent communication languages has typically taken the speech acts paradigm as its starting point. Despite their manifest attractions, speech-act models of communication have several...
Provided by AI Access Foundation
Keep Up with TechRepublic
Submit a Paper
Get your content listed in our directory!
Our directory is the largest library of vendor-supplied technical content on the Web. It’s also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors’ papers here - shouldn’t they find yours, too? It's FREE so click here and submit your white paper, case study, data sheet, research report, or other document today!
