370 search results - page 32 / 74 » Independent Sets with Domination Constraints |
113
Voted
WECWIS
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper introduces a new mediation mechanism into agent negotiations. The negotiation mechanism takes a supply-chain perspective to the construction of software services, attem...
213
Voted
AUSSOIS
2001
Springer
15 years 6 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
106
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
111
Voted
MICS
2010
15 years 9 days ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
112
click to vote
GRAPHICSINTERFACE
2009
14 years 11 months ago
2009
Haptic icons are brief, meaningful tactile or force stimuli designed to support the communication of information through the often-underutilized haptic modality. Challenges to pro...