Sciweavers

8699 search results - page 362 / 1740
» Elements of the Theory of Computation
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 10 days 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
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
HPDC
2002
IEEE
15 years 11 months ago
A Comparison of TCP Automatic Tuning Techniques for Distributed Computing
Rather than painful, manual, static, per-connection optimization of TCP buffer sizes simply to achieve acceptable performance for distributed applications [8, 10], many researcher...
Eric Weigle, Wu-chun Feng
ACL
2003
15 years 8 months ago
A Word-Order Database for Testing Computational Models of Language Acquisition
An investment of effort over the last two years has begun to produce a wealth of data concerning computational psycholinguistic models of syntax acquisition. The data is generated...
William Gregory Sakas
IJCAI
2001
15 years 8 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...