Sciweavers

284 search results - page 34 / 57
» On Some Polyhedra Covering Problems
Sort
View
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 8 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
JMLR
2010
144views more  JMLR 2010»
13 years 3 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 9 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
ROBOCOMM
2007
IEEE
14 years 3 months ago
Distributed adaptive sampling using bounded-errors
—This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. O...
Kévin Huguenin, Maria-João Rendas
ENC
2004
IEEE
14 years 18 days ago
Continuous Mode Changes in Mechatronic Systems
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode c...
Klaus Ecker, Andrei Tchernykh, Frank Drews, Silke ...