2004 search results - page 283 / 401 » Sampling from large graphs |
131
Voted
COMSWARE
2006
IEEE
15 years 8 months ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
118
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
120
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
130
Voted
EUROCAST
2007
Springer
15 years 6 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
129
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...