Sciweavers

705 search results - page 40 / 141
» Approximating Extended Answer Sets
Sort
View
ICLP
2009
Springer
15 years 10 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 4 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
15 years 3 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
SENSYS
2004
ACM
15 years 3 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 7 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...