4488 search results - page 226 / 898 » Focusing Search by Using Problem Solving Experience |
117
Voted
ICWL
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. The paper describes a complex e-learning experiment that has involved over 700 students that attended the Human-Computer Interaction course at the "Politehnica"...
125
click to vote
TCS
2008
15 years 4 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
150
click to vote
AE
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
147
Voted
SSD
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
135
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...