Sciweavers

873 search results - page 14 / 175
» Tournament scoring problem
Sort
View
IANDC
2007
123views more  IANDC 2007»
14 years 9 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
AAAI
2004
14 years 11 months ago
The U.S. National Football League Scheduling Problem
We describe the problem of scheduling the television broadcasts of the U.S. National Football League (NFL). Unlike traditional round-robin tournament scheduling, the NFL problem i...
Bistra N. Dilkina, William S. Havens
PPSN
2000
Springer
15 years 1 months ago
Spatial Games with Adaptive Tit-For-Tats
This paper presents an adaptive tit-for-tat strategy and a study of its behavior in spatial IPD games. The adaptive tit-for-tat strategy is shown elsewhere to demonstrate high perf...
Elpida Tzafestas
DAC
2012
ACM
12 years 12 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu
ICCV
2009
IEEE
14 years 7 months ago
Improving accuracy of geometric parameter estimation using projected score method
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...
Takayuki Okatani, Koichiro Deguchi