3874 search results - page 526 / 775 » Approximation Algorithms for k-hurdle Problems |
142
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
142
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
155
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
133
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
141
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...