Sciweavers

420 search results - page 64 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
EMSOFT
2009
Springer
15 years 1 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
73
Voted
ESOP
2007
Springer
15 years 3 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
FCT
2003
Springer
15 years 2 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
WIOPT
2006
IEEE
15 years 3 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...