Sciweavers

71 search results - page 14 / 15
» Foundations of Timed Concurrent Constraint Programming
Sort
View
TWC
2008
113views more  TWC 2008»
13 years 5 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
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...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
OOPSLA
1995
Springer
13 years 8 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
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...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 5 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
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...
Jochen Könemann, R. Ravi
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
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...
Georg Gottlob, Nicola Leone, Francesco Scarcello
AI
1998
Springer
13 years 5 months ago
Remote Agent: To Boldly Go Where No AI System Has Gone Before
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...
Nicola Muscettola, P. Pandurang Nayak, Barney Pell...