2214 search results - page 252 / 443 » Complexity of Reasoning |
168
click to vote
LADS
2007
Springer
16 years 17 days ago
2007
Springer
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...
179
click to vote
WDAG
2007
Springer
16 years 16 days ago
2007
Springer
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 ...
165
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— 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...
163
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
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...
183
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
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...