Sciweavers

16504 search results - page 46 / 3301
» New Problems, New Solutions
Sort
View
DAC
1995
ACM
15 years 8 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
WSCG
2004
153views more  WSCG 2004»
15 years 6 months ago
A New Algorithm for Adding Color to Video or Animation Clips
Colorizing grayscale video is a useful technique in scientific computing visualization and entertainment. In this paper, we introduce a method to transfer color from a reference i...
Zhigeng Pan, Zhaohua Dong, Mingmin Zhang
161
Voted
ATAL
2010
Springer
15 years 5 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
IC3
2009
15 years 2 months ago
A New Approach towards Bibliographic Reference Identification, Parsing and Inline Citation Matching
A number of algorithms and approaches have been proposed towards the problem of scanning and digitizing research papers. We can classify work done in the past into three major appr...
Deepank Gupta, Bob Morris, Terry Catapano, Guido S...
EVOW
2009
Springer
15 years 2 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao