Sciweavers

1557 search results - page 113 / 312
» Programming up to Congruence
Sort
View
APLAS
2006
ACM
15 years 8 months ago
A Localized Tracing Scheme Applied to Garbage Collection
We present a method to visit all nodes in a forest of data structures while taking into account object placement. We call the technique a Localized Tracing Scheme as it improves lo...
Yannis Chicha, Stephen M. Watt
ICALP
1995
Springer
15 years 8 months ago
New Collapse Consequences of NP Having Small Circuits
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
Johannes Köbler, Osamu Watanabe
NIPS
2007
15 years 6 months ago
Subspace-Based Face Recognition in Analog VLSI
We describe an analog-VLSI neural network for face recognition based on subspace methods. The system uses a dimensionality-reduction network whose coefficients can be either progr...
Gonzalo Carvajal, Waldo Valenzuela, Miguel Figuero...
EOR
2010
110views more  EOR 2010»
15 years 4 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
4OR
2006
100views more  4OR 2006»
15 years 4 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...