Sciweavers

879 search results - page 122 / 176
» A Constraint Programming Approach for the Service Consolidat...
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
CCE
2004
13 years 8 months ago
Efficient short-term scheduling of refinery operations based on a continuous time formulation
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to d...
Zhenya Jia, Marianthi G. Ierapetritou
CAV
2004
Springer
151views Hardware» more  CAV 2004»
14 years 7 days ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
IASTEDSE
2004
13 years 10 months ago
A symbolic Java virtual machine for test case generation
Quality management is becoming a more and more important part of the software development process. As software testing is currently understood as the core function of the quality ...
Roger A. Müller, Christoph Lembeck, Herbert K...
CN
2006
145views more  CN 2006»
13 years 8 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...