Sciweavers

4983 search results - page 35 / 997
» order 2008
Sort
View
IPL
2008
131views more  IPL 2008»
13 years 8 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
COR
2006
62views more  COR 2006»
13 years 8 months ago
Optimal batting orders in one-day cricket
This paper concerns the search for optimal or nearly optimal batting orders in one-day cricket. A search is conducted over the space of permutations of batting orders where simula...
Tim B. Swartz, Paramjit S. Gill, David Beaudoin, B...
SCL
2010
97views more  SCL 2010»
13 years 7 months ago
Krylov subspace methods for model order reduction of bilinear control systems
We discuss the use of Krylov subspace methods with regard to the problem of model order reduction. The focus lies on bilinear control systems, a special class of nonlinear systems...
Tobias Breiten, Tobias Damm
APAL
2008
92views more  APAL 2008»
13 years 8 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
IOR
2008
102views more  IOR 2008»
13 years 8 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini