Sciweavers

18306 search results - page 356 / 3662
» Algorithmics in Exponential Time
Sort
View
CONCUR
2006
Springer
15 years 8 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 9 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
EUROCRYPT
2004
Springer
16 years 6 days ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
ANOR
2010
112views more  ANOR 2010»
15 years 5 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
ECRTS
2006
IEEE
16 years 27 days ago
Real-Time Scheduling with Regenerative Energy
This paper investigates real-time scheduling in a system whose energy reservoir is replenished by an environmental power source. The execution of tasks is deemed primarily energy-...
Clemens Moser, Lothar Thiele, Luca Benini, Davide ...