7129 search results - page 96 / 1426 » Approximation Algorithms for Treewidth |
130
click to vote
PRICAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
121
click to vote
DFG
2009
Springer
15 years 9 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
121
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
102
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
132
click to vote
AAAI
2010
15 years 4 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...