Sciweavers

405 search results - page 57 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
ATAL
2003
Springer
15 years 4 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
CGF
2006
139views more  CGF 2006»
14 years 11 months ago
Pose Controlled Physically Based Motion
In this paper we describe a new method for generating and controlling physically-realistic motion of complex articulated characters. Our goal is to create motion from scratch, whe...
Raanan Fattal, Dani Lischinski
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 11 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
15 years 8 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
AMEC
2004
Springer
15 years 4 months ago
iAuctionMaker: A Decision Support Tool for Mixed Bundling
This paper presents iAuctionMaker as a novel tool that serves as a decision support for e-sourcing professionals on their pursuing of auction optimisation. Given a set of items to ...
Antonio Reyes-Moro, Juan A. Rodríguez-Aguil...