4843 search results - page 200 / 969 » The Shortcut Problem - Complexity and Approximation |
155
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
106
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
103
click to vote
CIG
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...
130
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
119
Voted
ADHOCNOW
2003
Springer
15 years 8 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...