Sciweavers

3052 search results - page 47 / 611
» Weakly Distributive Domains
Sort
View
IPPS
2008
IEEE
15 years 4 months ago
A parallel implementation of the Finite-Domain Time-Difference algorithm using MPJ express
This paper presents and evaluates a parallel Java implementation of the Finite-Difference Time-Domain (FDTD) method, which is a widely used numerical technique in computational el...
Aamir Shafi, Aftab Hussain, Jamil Raza
IMC
2004
ACM
15 years 3 months ago
Availability, usage, and deployment characteristics of the domain name system
The Domain Name System (DNS) is a critical part of the Internet’s infrastructure, and is one of the few examples of a robust, highlyscalable, and operational distributed system....
Jeffrey Pang, James Hendricks, Aditya Akella, Robe...
ICLP
2005
Springer
15 years 3 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
EWCBR
1993
Springer
15 years 1 months ago
Explanation-Driven Case-Based Reasoning
Problem solving in weak theory domains should compensate for the lack of strong theories by combining the various other knowledge types involved. Such methods should be able to eff...
Agnar Aamodt
IPL
2006
110views more  IPL 2006»
14 years 9 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway