Sciweavers

2479 search results - page 255 / 496
» A Computational Theory of Working Memory
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 10 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 10 months ago
Analysis of the difficulty of learning goal-scoring behaviour for robot soccer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
Jeff Riley, Victor Ciesielski
EACL
1993
ACL Anthology
15 years 8 months ago
Resolving Zero Anaphora in Japanese
The paper presents a computational theory for resolving Japanese zero anaphora, based on the notion of discourse segment. We see that the discourse segment reduces the domain of a...
Tadashi Nomoto, Yoshihiko Nitta
ENTCS
2002
108views more  ENTCS 2002»
15 years 6 months ago
Bisimulation Relations for Dynamical and Control Systems
In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notio...
Esfandiar Haghverdi, Paulo Tabuada, George J. Papp...
218
Voted
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Non-atomic Games for Multi-User Systems
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
Nicolas Bonneau, Mérouane Debbah, Eitan Alt...