Sciweavers

150 search results - page 14 / 30
» Solving Small TSPs with Constraints
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 3 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
CONSTRAINTS
2008
109views more  CONSTRAINTS 2008»
13 years 7 months ago
The Design of the Zinc Modelling Language
Zinc is a new modelling language developed as part of the G12 project. It has four important characteristics. First, Zinc allows speci cation of models using a natural mathematical...
Kim Marriott, Nicholas Nethercote, Reza Rafeh, Pet...
CVPR
2010
IEEE
14 years 3 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
INFOCOM
1998
IEEE
13 years 11 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan