3656 search results - page 143 / 732 » Compact Location Problems |
100
click to vote
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
125
click to vote
ISMVL
2006
IEEE
15 years 7 months ago
2006
IEEE
Multiple-valued logic can be viewed as an alternative approach to solving many problems in transmission, storage, and processing of large and even increasing amounts of informatio...
LAWEB
2003
IEEE
15 years 6 months ago
2003
IEEE
We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus....
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...