Sciweavers

2157 search results - page 247 / 432
» Binary ant algorithm
Sort
View
NIPS
2008
15 years 7 months ago
Tighter Bounds for Structured Estimation
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
Olivier Chapelle, Chuong B. Do, Quoc V. Le, Alexan...
ENTCS
2006
112views more  ENTCS 2006»
15 years 6 months ago
Distributed Symbolic Bounded Property Checking
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
Pradeep Kumar Nalla, Roland J. Weiss, Prakash Moha...
TWC
2008
105views more  TWC 2008»
15 years 6 months ago
An EM approach to multiple-access interference mitigation in asynchronous slow FHSS systems
In this paper, we apply the EM algorithm for mitigation of multi-access interference (MAI) in asynchronous slow frequency-hop spread spectrum (FHSS) systems that employ binary freq...
Xing Tan, John M. Shea
SIAMJO
2010
135views more  SIAMJO 2010»
15 years 4 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
FOGA
2011
14 years 9 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly