1289 search results - page 233 / 258 » Complexity of Counting the Optimal Solutions |
64
Voted
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
65
Voted
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
Spurred by technology leading to the availability of millions of gates per chip, system-level integration is evolving as a new paradigm, allowing entire systems to be built on a s...
RIDE
1998
IEEE
15 years 1 months ago
1998
IEEE
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
CG
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
88
Voted
SIROCCO
2008
14 years 11 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...