Sciweavers

601 search results - page 79 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 2 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 5 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
CHI
2009
ACM
16 years 2 months ago
Why and why not explanations improve the intelligibility of context-aware intelligent systems
Context-aware intelligent systems employ implicit inputs, and make decisions based on complex rules and machine learning models that are rarely clear to users. Such lack of system...
Brian Y. Lim, Anind K. Dey, Daniel Avrahami
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
15 years 7 months ago
Truthful Online Auctions for Pricing Peer-to-Peer Services
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
Po-An Chen, Tyng-Ruey Chuang
TKDE
2008
108views more  TKDE 2008»
15 years 1 months ago
Grid Service Discovery with Rough Sets
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
Maozhen Li, Bin Yu, Omer F. Rana, Zidong Wang