Sciweavers

24 search results - page 3 / 5
» Finding Crucial Subproblems to Focus Global Search
Sort
View
NLDB
2005
Springer
14 years 28 days ago
On Some Optimization Heuristics for Lesk-Like WSD Algorithms
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
DSD
2003
IEEE
108views Hardware» more  DSD 2003»
14 years 22 days ago
Concurrent Operation Scheduling and Unit Allocation with an Evolutionary Technique
This paper presents a method with an evolutionary approach to some of the tasks of integrated-circuit (IC) design. The work is focused on application-specific integrated circuits ...
Gregor Papa, Jurij Silc
WWW
2002
ACM
14 years 8 months ago
Visualizing web site comparisons
The Web is increasingly becoming an important channel for conducting businesses, disseminating information, and communicating with people on a global scale. More and more companie...
Bing Liu, Kaidi Zhao, Lan Yi
EVOW
2009
Springer
13 years 5 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao