453 search results - page 11 / 91 » On Approximation of Bookmark Assignments |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
EOR
2006
13 years 7 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
ISAAC
2001
Springer
13 years 12 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
NETWORKING
2007
13 years 9 months ago
2007
We study field-monitoring applications in which sensors are deployed in large numbers and the sensing process is expensive. In such applications, nodes should use the minimum poss...
COLING
2002
13 years 7 months ago
2002
The mapping between syntactic structure and prosodic structure is a widely discussed topic in linguistics. In this work we use insights gained from research on syntax-to-prosody m...