1298 search results - page 72 / 260 » The online set cover problem |
182
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
178
click to vote
AIPS
2009
15 years 7 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
186
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
135
click to vote
IADIS
2008
15 years 7 months ago
2008
The highly recognized concept of "active listening" is widely adopted in contexts that involve gathering information and solving problems. Demanding both verbal and nonv...
286
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...