Sciweavers

197 search results - page 24 / 40
» New Upper Bounds for Ramsey Numbers
Sort
View
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
14 years 8 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
BROADNETS
2005
IEEE
14 years 1 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
COMPGEOM
2010
ACM
14 years 1 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
CP
2007
Springer
13 years 12 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...