1197 search results - page 93 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
ICIP
2007
IEEE
14 years 2 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...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Real-world robotic environments are highly structured. The scalability of planning and reasoning methods to cope with complex problems in such environments crucially de...
IJCAI
1989
13 years 9 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
CONSTRAINTS
2007
13 years 8 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...