3875 search results - page 441 / 775 » Approximation algorithms for the 0-extension problem |
172
click to vote
COMPUTER
1999
15 years 6 months ago
1999
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
408
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
160
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
177
click to vote
ICTAI
2009
IEEE
16 years 1 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
201
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...