Sciweavers

204 search results - page 28 / 41
» Testing Triangle-Freeness in General Graphs
Sort
View
ENTCS
2007
103views more  ENTCS 2007»
13 years 7 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
EOR
2007
158views more  EOR 2007»
13 years 7 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
SC
1990
ACM
13 years 11 months ago
Loop distribution with arbitrary control flow
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
Ken Kennedy, Kathryn S. McKinley
EUROGP
2008
Springer
135views Optimization» more  EUROGP 2008»
13 years 9 months ago
Using Genetic Programming for Turing Machine Induction
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
Amashini Naidoo, Nelishia Pillay
WWW
2007
ACM
14 years 8 months ago
Finding community structure in mega-scale social networks: [extended abstract]
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
Ken Wakita, Toshiyuki Tsurumi