Sciweavers

1101 search results - page 202 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
ECAI
2008
Springer
13 years 10 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
AFRIGRAPH
2003
ACM
14 years 4 days ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
INFOCOM
2011
IEEE
13 years 5 days ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...
RECOMB
2005
Springer
14 years 8 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu
WINE
2007
Springer
126views Economy» more  WINE 2007»
14 years 2 months ago
A Theory of Loss-Leaders: Making Money by Pricing Below Cost
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Cha...