214 search results - page 39 / 43 » The node capacitated graph partitioning problem: A computati... |
129
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
161
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
149
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
153
Voted
INFORMS
1998
15 years 3 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
145
click to vote
JCO
2006
15 years 3 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...