Sciweavers

1254 search results - page 11 / 251
» Making Hard Problems Harder
Sort
View
ECRTS
2005
IEEE
14 years 1 months ago
Energy Aware Non-Preemptive Scheduling for Hard Real-Time Systems
Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Non-preemptive scheduling becomes an integral part of syste...
Ravindra Jejurikar, Rajesh K. Gupta
ICCV
2005
IEEE
14 years 1 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
WISES
2003
13 years 9 months ago
Adding Hard Real-time Capabilities to CORBA
Abstract — Control systems are often software-intensive applications that are becoming extremely complex as new functionality is required. Complexity is a real engineering challe...
Thomas Losert
SBRN
2008
IEEE
14 years 2 months ago
Using a Probabilistic Neural Network for a Large Multi-label Problem
The automation of the categorization of economic activities from business descriptions in free text format is a huge challenge for the Brazilian governmental administration in the...
Elias Oliveira, Patrick Marques Ciarelli, Alberto ...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 7 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev