72 search results - page 7 / 15 » A Fully Implicit Algorithm for Exact State Minimization |
148
click to vote
GLOBECOM
2006
IEEE
16 years 12 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
184
Voted
BROADNETS
2006
IEEE
15 years 10 months ago
2006
IEEE
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
158
Voted
CAI
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
177
Voted
DAC
2000
ACM
16 years 7 months ago
2000
ACM
A main advantage of control composition with modal processes [4] is the enhanced retargetability of the composed behavior over a wide variety of target architectures. Unlike previ...
159
click to vote
EWSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...