216 search results - page 23 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
This paper introduces the RL-TOPs architecture for robot learning, a hybrid system combining teleo-reactive planning and reinforcement learning techniques. The aim of this system ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
ICSE
2007
IEEE-ACM
14 years 7 months ago
2007
IEEE-ACM
Designing complex multi-tier applications that must meet strict performance requirements is a challenging software engineering problem. Ideally, the application architect could de...