1102 search results - page 181 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
129
click to vote
AAMAS
2005
Springer
15 years 12 days ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
115
click to vote
RTS
2002
15 years 4 days ago
2002
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
109
Voted
ILP
2005
Springer
15 years 6 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
CP
2008
Springer
15 years 1 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
91
Voted
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...