Sciweavers

6568 search results - page 392 / 1314
» Reducing the Complexity of Reductions
Sort
View
159
Voted
CF
2006
ACM
16 years 1 months ago
Instruction folding in a hardware-translation based java virtual machine
Bytecode hardware-translation improves the performance of a Java Virtual Machine (JVM) with small hardware resource and complexity overhead. Instruction folding is a technique to ...
Hitoshi Oi
161
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 1 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
ECOOP
2010
Springer
16 years 15 days ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
211
Voted
JELIA
2004
Springer
16 years 1 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
238
Voted
TSMC
2008
182views more  TSMC 2008»
15 years 7 months ago
Incremental Linear Discriminant Analysis for Face Recognition
Abstract--Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant...
Haitao Zhao, Pong Chi Yuen