Sciweavers

1964 search results - page 82 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
DATAMINE
2002
169views more  DATAMINE 2002»
13 years 7 months ago
Advances in Instance Selection for Instance-Based Learning Algorithms
The basic nearest neighbour classifier suffers from the indiscriminate storage of all presented training instances. With a large database of instances classification response time ...
Henry Brighton, Chris Mellish
WIA
2009
Springer
14 years 11 days ago
On Extremal Cases of Hopcroft's Algorithm
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
Giusi Castiglione, Antonio Restivo, Marinella Scio...
SEMWEB
2009
Springer
14 years 2 months ago
Results of OKKAM Feature based Entity Matching Algorithm for Instance Matching Contest of OAEI 2009
To investigate the problem of entity recognition, we deal with the creation of the so-called Entity Name System (ENS) which is an open, public back-bone infrastructure for the (Sem...
Heiko Stoermer, Nataliya Rassadko
ESWA
2010
105views more  ESWA 2010»
13 years 5 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
EOR
2008
105views more  EOR 2008»
13 years 7 months ago
The multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but...
Nabil Absi, Safia Kedad-Sidhoum