Sciweavers

2695 search results - page 35 / 539
» The Complexity of Forecast Testing
Sort
View
56
Voted
ICTAI
2005
IEEE
15 years 3 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
SE
2007
14 years 11 months ago
An integration framework for heterogeneous automatic software tests
: Developing and maintaining large software systems can require the usage of a variety of different automatic test tools. The complexity of the tools leads to considerable overhead...
Holger Schackmann, Horst Lichter, Veit Hoffmann
ISSTA
2004
ACM
15 years 3 months ago
Covering arrays for efficient fault characterization in complex configuration spaces
—Many modern software systems are designed to be highly configurable so they can run on and be optimized for a wide variety of platforms and usage scenarios. Testing such systems...
Cemal Yilmaz, Myra B. Cohen, Adam A. Porter
65
Voted
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
15 years 3 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
90
Voted
MICRO
2007
IEEE
167views Hardware» more  MICRO 2007»
15 years 4 months ago
Informed Microarchitecture Design Space Exploration Using Workload Dynamics
Program runtime characteristics exhibit significant variation. As microprocessor architectures become more complex, their efficiency depends on the capability of adapting with wor...
Chang-Burm Cho, Wangyuan Zhang, Tao Li