Sciweavers

18 search results - page 4 / 4
» Hybrid tractability of soft constraint problems
Sort
View
CP
2011
Springer
12 years 5 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
RTSS
1997
IEEE
13 years 9 months ago
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
Marco Caccamo, Giorgio C. Buttazzo
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm