526 search results - page 13 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
IWOMP
2009
Springer
15 years 4 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
INFOCOM
2012
IEEE
13 years 2 days ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
136
click to vote
PEPM
2011
ACM
14 years 14 days ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
EPIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we describe a novel approach to tackle intention recognition, by combining dynamically configurable and situation-sensitive Causal Bayes Networks plus pla...
FGCS
2000
14 years 9 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...