3637 search results - page 544 / 728 » On Dynamic Bit-Probe Complexity |
173
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
152
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
150
click to vote
ATVA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
151
click to vote
COCOA
2007
Springer
16 years 21 days ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
176
click to vote
DEXA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...