71 search results - page 14 / 15 » Foundations of Timed Concurrent Constraint Programming |
176
click to vote
TWC
2008
15 years 5 months ago
2008
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
217
click to vote
OOPSLA
1995
Springer
15 years 9 months ago
1995
Springer
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
165
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
190
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
181
click to vote
AI
1998
Springer
15 years 5 months ago
1998
Springer
Renewed motives for space exploration have inspired NASA to work toward the goal of establishing a virtual presence in space, through heterogeneous eets of robotic explorers. Info...