Sciweavers

2343 search results - page 2 / 469
» Visual-Concept Search Solved
Sort
View
SAC
2004
ACM
14 years 3 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
14 years 1 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
ERCIMDL
2000
Springer
127views Education» more  ERCIMDL 2000»
14 years 1 months ago
Effects of Cognitive and Problem Solving Style on Internet Search Tool
This paper presents a research proposal on user -oriented evaluation method to compar e the usability of Internet search tools. Cognitive style and problem solving style are identi...
Lim Tek Yong, Tang Enya Kong
TWC
2008
158views more  TWC 2008»
13 years 9 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
AIPS
1998
13 years 11 months ago
How to Solve It Automatically: Selection Among Problem Solving Methods
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
Eugene Fink