Sciweavers

274 search results - page 25 / 55
» Multi-goal economic search using dynamic search structures
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
GECCO
2010
Springer
254views Optimization» more  GECCO 2010»
14 years 14 days ago
Evolving viral marketing strategies
One method of viral marketing involves seeding certain consumers within a population to encourage faster adoption of the product throughout the entire population. However, determi...
Forrest Stonedahl, William Rand, Uri Wilensky
APN
2003
Springer
14 years 27 days ago
Deciding Life-Cycle Inheritance on Petri Nets
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynam...
H. M. W. (Eric) Verbeek, Twan Basten
FLAIRS
2008
13 years 10 months ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Mathias Niepert, Cameron Buckner, Colin Allen