Sciweavers

5316 search results - page 46 / 1064
» Which Search Problems Are Random
Sort
View
95
Voted
EVOW
2007
Springer
15 years 7 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
99
Voted
ERCIMDL
2000
Springer
127views Education» more  ERCIMDL 2000»
15 years 4 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
88
Voted
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
15 years 7 months ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
168
Voted
CP
1995
Springer
15 years 4 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
TWC
2008
158views more  TWC 2008»
15 years 19 days 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