2657 search results - page 264 / 532 » On the complexity of hierarchical problem solving |
209
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
168
Voted
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
195
Voted
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
198
click to vote
AAMAS
2010
Springer
15 years 6 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
169
click to vote
JSA
1998
15 years 6 months ago
1998
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...