Sciweavers

749 search results - page 89 / 150
» Combinatory Models and Symbolic Computation
Sort
View
DAGSTUHL
1990
13 years 11 months ago
Integrating Rules and Connectionism for Robust Reasoning
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
Ron Sun
IWCMC
2006
ACM
14 years 4 months ago
Security aspects of inter-satellite links using neural networks
This paper presents a neural network model for routing in the space segment of a Satellite Personal Communication System. At first, a proper energy function is constructed from th...
Peter P. Stavroulakis, Ioannis Dimou, Harilaos G. ...
DNA
2005
Springer
132views Bioinformatics» more  DNA 2005»
14 years 3 months ago
DNA Recombination by XPCR
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, ...
CP
2004
Springer
14 years 3 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 3 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...