Sciweavers

11740 search results - page 164 / 2348
» More Problems in Rewriting
Sort
View
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
15 years 9 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
WSNA
2003
ACM
15 years 9 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
FOCS
1997
IEEE
15 years 8 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
AAAI
2000
15 years 5 months ago
TCBB Scheme: Applications to Single Machine Job Sequencing Problems
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
Sakib A. Mondal, Anup K. Sen
ICIP
2009
IEEE
16 years 5 months ago
Monotone Operator Splitting For Optimization Problems In Sparse Recovery
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...