Sciweavers

1983 search results - page 155 / 397
» Competitive graph searches
Sort
View
FLAIRS
2007
13 years 10 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
AIPS
2009
13 years 9 months ago
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed b...
Patrick Eyerich, Robert Mattmüller, Gabriele ...
CEC
2010
IEEE
13 years 9 months ago
Elitist Artificial Bee Colony for constrained real-parameter optimization
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
Efrén Mezura-Montes, Ramiro Ernesto Velez-K...
IWPEC
2010
Springer
13 years 6 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
NAACL
2010
13 years 6 months ago
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
Michael Heilman, Noah A. Smith