Sciweavers

151 search results - page 29 / 31
» The Minimum Generalized Vertex Cover Problem
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CSL
2007
Springer
13 years 11 months ago
Lambda Theories of Effective Lambda Models
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
Chantal Berline, Giulio Manzonetto, Antonino Salib...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
EDOC
2002
IEEE
14 years 9 days ago
Business Modelling for Component Systems with UML
The EC funded COMBINE Project has the objective of dramatically improving software development productivity by providing a holistic approach to component-based development of Ente...
Sandy Tyndale-Biscoe, Oliver Sims, Bryan Wood, Chr...
MOBICOM
2005
ACM
14 years 28 days ago
Barrier coverage with wireless sensors
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
Santosh Kumar, Ten-Hwang Lai, Anish Arora