Sciweavers

86 search results - page 9 / 18
» Automatic Generation of Propagation Rules for Finite Domains
Sort
View
SIGCOMM
2004
ACM
14 years 27 days ago
The design and implementation of a next generation name service for the internet
Name services are critical for mapping logical resource names to physical resources in large-scale distributed systems. The Domain Name System (DNS) used on the Internet, however,...
Venugopalan Ramasubramanian, Emin Gün Sirer
BMCBI
2006
144views more  BMCBI 2006»
13 years 7 months ago
Association algorithm to mine the rules that govern enzyme definition and to classify protein sequences
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
Shih-Hau Chiu, Chien-Chi Chen, Gwo-Fang Yuan, Thy-...
AGENTS
2001
Springer
13 years 12 months ago
Automated negotiation from declarative contract descriptions
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
Daniel M. Reeves, Michael P. Wellman, Benjamin N. ...
DAGSTUHL
1996
13 years 8 months ago
Multi-Level Lambda-Calculi: An Algebraic Description
Abstract. Two-level -calculi have been heavily utilised for applications such as partial evaluation, abstract interpretation and code generation. Each of these applications pose di...
Flemming Nielson, Hanne Riis Nielson
ICLP
2009
Springer
14 years 8 months ago
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
Neng-Fa Zhou