Sciweavers

2214 search results - page 252 / 443
» Complexity of Reasoning
Sort
View
127
Voted
LADS
2007
Springer
15 years 9 months ago
Facilitating Agent Development in Open Distributed Systems
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...
Mauro Gaspari, Davide Guidi
141
Voted
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 9 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
129
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Simple Directional Antennas: Improving Performance in Wireless Multihop Networks
— Directional antennas are a promising option for use in ad-hoc networks for a variety of reasons, such as increased spatial reuse, reduced interference and enabling more effici...
Kok-Kiong Yap, Wai-Leong Yeow, Mehul Motani, Chen-...
127
Voted
ICLP
2005
Springer
15 years 9 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
142
Voted
MFCS
2005
Springer
15 years 9 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher