Sciweavers

1381 search results - page 91 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
TAMC
2009
Springer
15 years 8 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
DATE
2005
IEEE
120views Hardware» more  DATE 2005»
15 years 9 months ago
Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints
Supply voltage scaling and adaptive body-biasing are important techniques that help to reduce the energy dissipation of embedded systems. This is achieved by dynamically adjusting...
Alexandru Andrei, Marcus T. Schmitz, Petru Eles, Z...
ENTCS
2007
101views more  ENTCS 2007»
15 years 4 months ago
A Framework for Timed Concurrent Constraint Programming with External Functions
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
María Alpuente, Bernhard Gramlich, Alicia V...
168
Voted
CVPR
2012
IEEE
13 years 6 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
129
Voted
DSOM
2006
Springer
15 years 7 months ago
Detecting Bottleneck in n-Tier IT Applications Through Analysis
As the complexity of large-scale enterprise applications increases, providing performance verification through staging becomes an important part of reducing business risks associat...
Gueyoung Jung, Galen S. Swint, Jason Parekh, Calto...