Sciweavers

4403 search results - page 25 / 881
» Galois Theory of Algorithms
Sort
View
77
Voted
INFSOF
2006
73views more  INFSOF 2006»
15 years 1 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
DMTCS
2003
93views Mathematics» more  DMTCS 2003»
15 years 3 months ago
Two Philosophical Applications of Algorithmic Information Theory
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
Gregory J. Chaitin
EUROCAST
2003
Springer
105views Hardware» more  EUROCAST 2003»
15 years 7 months ago
A Self-adaptive Model for Selective Pressure Handling within the Theory of Genetic Algorithms
In this paper we introduce a new generic selection method for Genetic Algorithms. The main difference of this selection principle in contrast to conventional selection models is g...
Michael Affenzeller, Stefan Wagner 0002
EWSN
2004
Springer
15 years 7 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
JMLR
2008
159views more  JMLR 2008»
15 years 1 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin