1277 search results - page 90 / 256 » Terminating Decision Algorithms Optimally |
110
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
98
Voted
WSC
2008
15 years 5 months ago
2008
In this paper, an automation concept is proposed to facilitate the simulation model building for port design problem. Currently, this process, which includes drawing the terminal ...
140
Voted
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
130
Voted
ICPPW
2007
IEEE
15 years 9 months ago
2007
IEEE
Several challenges about computational grid exist in integrating, coordinating and managing of resources and scheduling of applications, due to distributed resources at various le...
129
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...