Sciweavers

2354 search results - page 49 / 471
» Assignment Problems
Sort
View
TKDE
2008
118views more  TKDE 2008»
13 years 9 months ago
A Lagrangian Approach for Multiple Personalized Campaigns
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
ICCAD
2009
IEEE
154views Hardware» more  ICCAD 2009»
13 years 7 months ago
Pad assignment for die-stacking System-in-Package design
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
Yu-Chen Lin, Wai-Kei Mak, Chris Chu, Ting-Chi Wang
SAC
2005
ACM
14 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
ICRA
2007
IEEE
124views Robotics» more  ICRA 2007»
14 years 4 months ago
Sensor-Based Dynamic Assignment in Distributed Motion Planning
— Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. Recently, one such great challenge has been the development...
Michael M. Zavlanos, George J. Pappas
TROB
2008
164views more  TROB 2008»
13 years 9 months ago
Dynamic Assignment in Distributed Motion Planning With Local Coordination
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
Michael M. Zavlanos, George J. Pappas