Sciweavers

24 search results - page 5 / 5
» Bounded fixed-parameter tractability and reducibility
Sort
View
MFCS
2009
Springer
13 years 11 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He
IANDC
2008
112views more  IANDC 2008»
13 years 5 months ago
Inclusion dynamics hybrid automata
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
Alberto Casagrande, Carla Piazza, Alberto Policrit...
EOR
2007
101views more  EOR 2007»
13 years 5 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
CASES
2004
ACM
13 years 10 months ago
Safely exploiting multithreaded processors to tolerate memory latency in real-time systems
A coarse-grain multithreaded processor can effectively hide long memory latencies by quickly switching to an alternate task when the active task issues a memory request, improving...
Ali El-Haj-Mahmoud, Eric Rotenberg