1480 search results - page 215 / 296 » Ants can solve constraint satisfaction problems |
188
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
163
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
147
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
164
click to vote
TCBB
2008
15 years 6 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
135
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...