Sciweavers

207 search results - page 17 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
ASPDAC
2005
ACM
109views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Optimal module and voltage assignment for low-power
– Reducing power consumption through high-level synthesis has attracted a growing interest from researchers due to its large potential for power reduction. In this work we study ...
Deming Chen, Jason Cong, Junjuan Xu
DAGSTUHL
1997
14 years 11 months ago
Fast and Accurate Collision Detection for Virtual Environments
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
Ming C. Lin
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 4 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
15 years 10 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
CEC
2009
IEEE
15 years 4 months ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao