Sciweavers

1816 search results - page 120 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
15 years 7 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
CHI
2005
ACM
16 years 6 months ago
Connecting with kids: so what's new?
From pre-schools to high schools, at home and in museums, the educational community has embraced the use of computers as a teaching tool. Yet many institutions will simply install...
Lori L. Scarlatos, Amy Bruckman, Allison Druin, Mi...
EVOW
1994
Springer
15 years 10 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
153
Voted
GECON
2007
Springer
124views Business» more  GECON 2007»
16 years 12 days ago
On Business Grid Demands and Approaches
This paper addresses necessary modification and extensions of existing Grid Computing approaches in order to meet nowadays business demand. So far, Grid Computing has been used to...
Carsten Franke, Adolf Hohl, Philip Robinson, Bernd...
ICCBR
2009
Springer
15 years 4 months ago
Constraint-Based Case-Based Planning Using Weighted MAX-SAT
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
Hankui Zhuo, Qiang Yang, Lei Li