Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.

0
posts
with
0
views
98profile views
xiaolonghuangStudent, PhD
xiaolonghuang
SIAMJO
2011
10 years 12 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
CORR
2010
Springer
102views Education» more  CORR 2010»
11 years 14 days ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
ICMLA
2009
11 years 3 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
HOLOMAS
2009
Springer
11 years 3 months ago
Collaboration of Metaheuristic Algorithms through a Multi-Agent System
Abstract. This paper introduces a framework based on multi-agent system for solving problems of combinatorial optimization. The framework allows running various metaheuristic algor...
Richard Malek
CPAIOR
2010
Springer
11 years 3 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
MP
2010
116views more  MP 2010»
11 years 3 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford
JGO
2010
117views more  JGO 2010»
11 years 4 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
NPL
1998
133views more  NPL 1998»
11 years 5 months ago
Parallel Coarse Grain Computing of Boltzmann Machines
Abstract. The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigm...
Julio Ortega, Ignacio Rojas, Antonio F. Día...
JCC
2006
69views more  JCC 2006»
11 years 5 months ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo
books