Sciweavers

210 search results - page 31 / 42
» Some Competition Programming Problems as the Beginning of Ar...
Sort
View
AIPS
2009
14 years 10 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
ISER
2000
Springer
111views Robotics» more  ISER 2000»
15 years 1 months ago
Progress in RoboCup Soccer Research in 2000
: In addition to researchers in AI and robotics, RoboCup attracts ordinary people, especially kids, high school and university students. Over 3000 people from 35 nations around the...
Minoru Asada, Andreas Birk 0002, Enrico Pagello, M...
CEC
2007
IEEE
15 years 3 months ago
Estimation of distribution algorithms for testing object oriented software
— One of the main tasks software testing involves is the generation of the test cases to be used during the test. Due to its expensive cost, the automation of this task has becom...
Ramón Sagarna, Andrea Arcuri, Xin Yao
AIIA
1999
Springer
15 years 1 months ago
An Implementation for Abductive Logic Agents
This paper presents thedistributed implementationof ALIAS, an architecture composed of several cooperating intelligent agents. This system is particularly suited to solve problems ...
Anna Ciampolini, Evelina Lamma, Paola Mello, Cesar...
CP
2009
Springer
15 years 10 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný