Sciweavers

612 search results - page 68 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
ACMSE
2004
ACM
14 years 1 months ago
A model-driven approach for generating embedded robot navigation control software
Real-time embedded systems are time-critical systems that are hard to implement as compared to traditional commercial software, due to the large number of conflicting requirements...
Bina Shah, Rachael Dennison, Jeff Gray
GI
2004
Springer
14 years 1 months ago
Realtime Ray Tracing for Current and Future Games
: Recently, realtime ray tracing has been developed to the point where it is becoming a possible alternative to the current rasterization approach for interactive 3D graphics. With...
Jörg Schmittler, Daniel Pohl, Tim Dahmen, Chr...
STACS
2004
Springer
14 years 1 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
TCS
1998
13 years 7 months ago
Threshold Dominating Sets and an Improved Characterization of W[2]
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
Rodney G. Downey, Michael R. Fellows
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 2 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan