1995 search results - page 37 / 399 » What's the Problem |
113
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
123
Voted
AIPS
2008
15 years 5 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
138
click to vote
DISOPT
2007
15 years 3 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
133
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
116
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we study the cheap control problem and determine what some of the inherent system limitations are in achieving high performance for LTI systems. In particular, we ob...