Sciweavers

336 search results - page 64 / 68
» Program Speedups in Theory and Practice
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
MOBIHOC
2002
ACM
14 years 7 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
13 years 11 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
SDB
1995
178views Database» more  SDB 1995»
13 years 11 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
WWW
2003
ACM
14 years 8 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon