Sciweavers

8413 search results - page 200 / 1683
» Ordering Problem Subgoals
Sort
View
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
15 years 6 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
90
Voted
HICSS
2005
IEEE
123views Biometrics» more  HICSS 2005»
15 years 6 months ago
Enterprise Architecting: Critical Problems
An enterprise architecture (EA) identifies the main components of the organization, its information systems, the ways in which these components work together in order to achieve d...
Stephen H. Kaisler, Frank Armour, Michael Valivull...
ICALP
2005
Springer
15 years 6 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
103
Voted
DIAGRAMS
2004
Springer
15 years 6 months ago
Predictors of Success in Diagrammatic Problem Solving
Abstract. We conducted an eye-tracking study of mechanical problem solving from cross-sectional diagrams of devices. Response time, accuracy and eye movement data were collected an...
Daesub Yoon, N. Hari Narayanan
81
Voted
FOCS
2002
IEEE
15 years 5 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...