Sciweavers

8689 search results - page 27 / 1738
» Software: hard data
Sort
View
FSTTCS
2007
Springer
14 years 2 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
NCA
2005
IEEE
14 years 2 months ago
Providing Hard Real-Time Guarantees in Context-Aware Applications: Challenges and Requirements
Context-aware applications rely on the ability to perceive the state of the surrounding environment. In this paper, we address a class of such applications where real-time guarant...
Malika Boulkenafed, Barbara Hughes, René Me...
FSTTCS
2004
Springer
14 years 2 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
SIGSOFT
2002
ACM
14 years 9 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
EMSOFT
2009
Springer
14 years 3 months ago
Implementing time-predictable load and store operations
Scratchpads have been widely proposed as an alternative to caches for embedded systems. Advantages of scratchpads include reduced energy consumption in comparison to a cache and a...
Jack Whitham, Neil C. Audsley