Sciweavers

2035 search results - page 149 / 407
» Working memory
Sort
View
ASPLOS
2012
ACM
13 years 11 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
105
Voted
CASES
2001
ACM
15 years 7 months ago
A system-on-a-chip lock cache with task preemption support
Intertask/interprocess synchronization overheads may be significant in a multiprocessor-shared memory System-on-a-Chip implementation. These overheads are observed in terms of loc...
Bilge Saglam Akgul, Jaehwan Lee, Vincent John Moon...
137
Voted
SIROCCO
2001
15 years 4 months ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin
129
Voted
ROBOCUP
2005
Springer
117views Robotics» more  ROBOCUP 2005»
15 years 9 months ago
Towards Eliminating Manual Color Calibration at RoboCup
Color calibration is a time-consuming, and therefore costly requirement for most robot teams at RoboCup. This paper presents an approach for autonomous color learning on-board a mo...
Mohan Sridharan, Peter Stone
131
Voted
EDOC
2008
IEEE
15 years 5 months ago
Runtime Monitoring of Message-Based Workflows with Data
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
Sylvain Hallé, Roger Villemaire