Sciweavers

1132 search results - page 98 / 227
» Structural Average Case Complexity
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
A simple power-aware scheduling for multicore systems when running real-time applications
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational require...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
MEMOCODE
2008
IEEE
14 years 3 months ago
Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
Radu Mateescu, Emilie Oudot
MFCS
2005
Springer
14 years 2 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
FOCS
1999
IEEE
14 years 1 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
DATE
2004
IEEE
113views Hardware» more  DATE 2004»
14 years 21 days ago
Dynamic Memory Management Design Methodology for Reduced Memory Footprint in Multimedia and Wireless Network Applications
New portable consumer embedded devices must execute multimedia and wireless network applications that demand extensive memory footprint. Moreover, they must heavily rely on Dynami...
David Atienza, Stylianos Mamagkakis, Francky Catth...