Sciweavers

5101 search results - page 450 / 1021
» Capturing Context Requirements
Sort
View
CASES
2009
ACM
15 years 4 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
JOCN
2011
103views more  JOCN 2011»
15 years 1 months ago
Role for Presupplementary Motor Area in Inhibition of Cognitive Set Interference
■ Proactive interference (PI), which is formed through repetition of certain behavior and lasts for a while, needs to be inhibited in order for subsequent behavior to prevail ov...
Seiki Konishi, Takamitsu Watanabe, Koji Jimura, Ju...
AIPS
2011
14 years 10 months ago
Scheduling an Aircraft Repair Shop
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
Maliheh Aramon Bajestani, J. Christopher Beck
ICDE
2002
IEEE
146views Database» more  ICDE 2002»
16 years 8 months ago
Data Mining Meets Performance Evaluation: Fast Algorithms for Modeling Bursty Traffic
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
Mengzhi Wang, Ngai Hang Chan, Spiros Papadimitriou...
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb