Sciweavers

662 search results - page 34 / 133
» Formalizing Basic First Order Model Theory
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
ICIP
2004
IEEE
14 years 9 months ago
Tikhonov regularization versus scale space: A new result
It is well-known that scale space theory and Tikhonov regularization are close-knit. In previous studies qualitative analogies and formal relations had already been found, but non...
Luc Florack, Remco Duits, Joris Bierkens
AAAI
1998
13 years 9 months ago
Emotion Model for Life-Like Agent and Its Evaluation
This paper proposes an emotion model for life-like agents with emotions and motivations. This model consists of reactive and deliberative mechanisms. The former generates low-leve...
Hirohide Ushida, Yuji Hirayama, Hiroshi Nakajima
AI
1998
Springer
13 years 7 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque