Sciweavers

1302 search results - page 243 / 261
» Fair Equivalence Relations
Sort
View
CP
2005
Springer
14 years 1 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
OOPSLA
2005
Springer
14 years 1 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
14 years 1 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag
MIDDLEWARE
2004
Springer
14 years 1 months ago
Guiding Queries to Information Sources with InfoBeacons
The Internet provides a wealth of useful information in a vast number of dynamic information sources, but it is difficult to determine which sources are useful for a given query. ...
Brian F. Cooper
OOPSLA
2004
Springer
14 years 1 months ago
Hard real-time: C++ versus RTSJ
In the domain of hard real-time systems, which language is better: C++ or the Real-Time Specification for Java (RTSJ)? Although standard Java provides a more productive programmin...
Daniel L. Dvorak, William K. Reinholtz