Sciweavers

ENTCS
2008
108views more  ENTCS 2008»
13 years 9 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry
ENGL
2008
192views more  ENGL 2008»
13 years 9 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
EJC
2008
13 years 9 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
ALIFE
2006
13 years 9 months ago
Neurocontroller Analysis via Evolutionary Network Minimization
This study presents a new evolutionary network minimization (ENM) algorithm. Neurocontroller minimization is beneficial for finding small parsimonious networks that permit a better...
Zohar Ganon, Alon Keinan, Eytan Ruppin
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 9 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 9 months ago
Parallelizing Feature Selection
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...
Jerffeson Teixeira de Souza, Stan Matwin, Nathalie...
EOR
2010
110views more  EOR 2010»
13 years 9 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
EOR
2010
149views more  EOR 2010»
13 years 9 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
EOR
2010
119views more  EOR 2010»
13 years 9 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
DKE
2008
91views more  DKE 2008»
13 years 9 months ago
SUSAX: Context-specific searching in XML documents using sequence alignment techniques
Keyword searching while very successful in narrowing down the contents of the Web to the pertaining subset of information, has two primary drawbacks. First, the accuracy of the se...
Kajal T. Claypool