Sciweavers

595 search results - page 17 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
FLAIRS
2004
13 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
ASPLOS
1992
ACM
13 years 11 months ago
Application-Controlled Physical Memory using External Page-Cache Management
Next generation computer systems will have gigabytes of physical memory and processors in the 200 MIPS range or higher. While this trend suggests that memory management for most p...
Kieran Harty, David R. Cheriton
ASPDAC
1995
ACM
103views Hardware» more  ASPDAC 1995»
13 years 11 months ago
A scheduling algorithm for multiport memory minimization in datapath synthesis
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
Hae-Dong Lee, Sun-Young Hwang
JAVA
1999
Springer
13 years 11 months ago
Fixing the Java Memory Model
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. The Java memory model is hard to interp...
William Pugh
IROS
2007
IEEE
144views Robotics» more  IROS 2007»
14 years 1 months ago
Faster and more accurate face detection on mobile robots using geometric constraints
— We develop a framework to allow generic object detection algorithms to exploit geometric information commonly available to robot vision systems. Robot systems take pictures wit...
Michael Dixon, Frederick Heckel, Robert Pless, Wil...