Sciweavers

592 search results - page 112 / 119
» Using Constraint Programming to Solve the Maximum Clique Pro...
Sort
View
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 1 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
SCP
2010
155views more  SCP 2010»
14 years 7 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
SIAMJO
2008
93views more  SIAMJO 2008»
14 years 9 months ago
Multivariable Utility Functions
Abstract. Utility functions of several variables are ubiquitous in economics. Their maximization requires inversion of the gradient map. Using convex analysis tools, we provide a r...
Maria B. Chiarolla, Ulrich G. Haussmann
IEEECIT
2009
IEEE
15 years 4 months ago
SLA-Aware Virtual Resource Management for Cloud Infrastructures
Cloud platforms host several independent applications on a shared resource pool with the ability to allocate computing power to applications on a per-demand basis. The use of serv...
Hien Nguyen Van, Frédéric Dang Tran,...