9949 search results - page 314 / 1990 » On the Network Complexity of Selection |
209
click to vote
PARA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. This contribution presents algorithms, methods, and software for a Grid resource manager, responsible for resource brokering and scheduling in early production Grids. The...
171
click to vote
UAI
2008
15 years 8 months ago
2008
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
171
click to vote
AAAI
2000
15 years 8 months ago
2000
Sampling has become an important strategy for inference in belief networks. It can also be applied to the problem of selecting actions in influence diagrams. In this paper, we pre...
157
click to vote
COR
2008
15 years 6 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
144
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Grasping is a central issue of various robot applications, especially when unknown objects have to be manipulated by the system. In earlier work, we have shown the efficiency ...