381 search results - page 36 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
NIPS
2004
13 years 9 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
RTSS
2007
IEEE
14 years 2 months ago
2007
IEEE
Recent technological advances have opened up several distributed real-time applications involving battery-driven embedded devices with local processing and wireless communication ...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
AAAI
2004
13 years 9 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...