3678 search results - page 189 / 736 » On the Stable Paths Problem |
151
click to vote
ANOR
2008
15 years 3 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
119
click to vote
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investig...
141
click to vote
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
136
click to vote
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We address the problem of identifying high throughput paths in 802.11 wireless mesh networks. We introduce an analytical model that accurately captures the 802.11 MAC p...
116
click to vote
APPT
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...