Sciweavers

976 search results - page 27 / 196
» The Complexity of Timetable Construction Problems
Sort
View
PR
2007
118views more  PR 2007»
13 years 6 months ago
A cooperative constructive method for neural networks for pattern recognition
In this paper, we propose a new constructive method, based on cooperative coevolution, for designing automatically the structure of a neural network for classification. Our appro...
Nicolás García-Pedrajas, Domingo Ort...
ICFP
2007
ACM
14 years 7 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
PDPTA
2007
13 years 8 months ago
Scalable Overlay Multicast Tree Construction for Media Streaming
Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack...
Gabriel Parmer, Richard West, Gerald Fry
SIAMSC
2008
129views more  SIAMSC 2008»
13 years 7 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros