Sciweavers

127 search results - page 24 / 26
» The Directed Planar Reachability Problem
Sort
View
AIPS
2008
14 years 5 days ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
WIDM
2003
ACM
14 years 3 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 10 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
SIGCOMM
2009
ACM
14 years 4 months ago
SMACK: a SMart ACKnowledgment scheme for broadcast messages in wireless networks
Network protocol designers, both at the physical and network level, have long considered interference and simultaneous transmission in wireless protocols as a problem to be avoide...
Aveek Dutta, Dola Saha, Dirk Grunwald, Douglas C. ...
JACM
2008
91views more  JACM 2008»
13 years 9 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari