Sciweavers

808 search results - page 110 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
PPDP
2010
Springer
14 years 11 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
131
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 3 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
90
Voted
ICML
2004
IEEE
16 years 1 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
106
Voted
CF
2009
ACM
15 years 5 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
92
Voted
IUI
2004
ACM
15 years 6 months ago
SUPPLE: automatically generating user interfaces
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
Krzysztof Gajos, Daniel S. Weld