Sciweavers

4949 search results - page 687 / 990
» Consistency and Set Intersection
Sort
View
ASIAN
2004
Springer
69views Algorithms» more  ASIAN 2004»
16 years 25 days ago
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
Lars Lundberg, Håkan Lennerstad, Kamilla Klo...
CAV
2004
Springer
99views Hardware» more  CAV 2004»
16 years 25 days ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...
COORDINATION
2004
Springer
16 years 24 days ago
A Lightweight Coordination Middleware for Mobile Computing
This paper presents Limone, a new coordination model that facilitates rapid application development over ad hoc networks consisting of logically mobile agents and physically mobile...
Chien-Liang Fok, Gruia-Catalin Roman, Gregory Hack...
ECAI
2004
Springer
16 years 24 days ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo
ECAI
2004
Springer
16 years 24 days ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...