Sciweavers

1763 search results - page 151 / 353
» Visualize and Open Up
Sort
View
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 6 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
JCP
2007
92views more  JCP 2007»
15 years 6 months ago
Lifelong Learning, Empirical Modelling and the Promises of Constructivism
—Educational technology is seen as key for lifelong learning, but it has yet to live up to expectation. We argue that current learning environments are typically oriented too muc...
Meurig Beynon, Antony Harfield
AIR
2004
134views more  AIR 2004»
15 years 6 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
Vincent Tam, Keng Teck Ma
CSUR
2000
69views more  CSUR 2000»
15 years 6 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet
CORR
2002
Springer
144views Education» more  CORR 2002»
15 years 6 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier