9842 search results - page 1646 / 1969 » The Complexity of the Matching-Cut Problem |
178
click to vote
SIGECOM
2004
ACM
16 years 3 days ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
160
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
191
click to vote
VRST
2004
ACM
16 years 3 days ago
2004
ACM
We have integrated technologies related to virtual social interaction, e.g. virtual environments, visual simulations, and lifelike characters. In our previous efforts to integrate...
144
click to vote
CAISE
2004
Springer
16 years 2 days ago
2004
Springer
In architecture companies, work is very often performed by several individuals. From conceptual design to the construction of a final product, the object passes through many hands,...
147
Voted
CG
2004
Springer
16 years 2 days ago
2004
Springer
The TAC 2003 supply-chaingame presented automated trading agents with a challenging strategic problem. Embedded within a complex stochastic environment was a pivotal strategic deci...