Sciweavers

4488 search results - page 209 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
15 years 3 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
115
Voted
CEC
2005
IEEE
15 years 9 months ago
Adaptive local search parameters for real-coded memetic algorithms
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Daniel Molina, Francisco Herrera, Manuel Lozano
CHI
2003
ACM
16 years 4 months ago
Repairing usability problems identified by the cognitive walkthrough for the web
Methods for identifying usability problems in web page designs should ideally also provide practical methods for repairing the problems found. Blackmon et al. [2] proved the usefu...
Marilyn Hughes Blackmon, Muneo Kitajima, Peter G. ...
139
Voted
DEBU
2010
99views more  DEBU 2010»
15 years 4 months ago
Search-As-You-Type: Opportunities and Challenges
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
Chen Li, Guoliang Li
130
Voted
TSMC
1998
78views more  TSMC 1998»
15 years 3 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath