Sciweavers

4536 search results - page 838 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
FOSSACS
2005
Springer
14 years 3 months ago
A Computational Model for Multi-variable Differential Calculus
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
Abbas Edalat, André Lieutier, Dirk Pattinso...
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 3 months ago
XCS for robust automatic target recognition
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyo...
B. Ravichandran, Avinash Gandhe, Robert E. Smith
IPSN
2005
Springer
14 years 3 months ago
A robust architecture for distributed inference in sensor networks
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
Mark A. Paskin, Carlos Guestrin, Jim McFadden
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 3 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà