1650 search results - page 130 / 330 » The HOM problem is decidable |
148
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
136
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
110
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. W...
135
click to vote
IANDC
2006
15 years 4 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
143
click to vote
ANOR
2005
15 years 4 months ago
2005
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner...