Sciweavers

195 search results - page 6 / 39
» Evolving by Maximizing the Number of Rules: Complexity Study
Sort
View
OOPSLA
2005
Springer
15 years 3 months ago
Using dependency models to manage complex software architecture
An approach to managing the architecture of large software systems is presented. Dependencies are extracted from the code by a conventional static analysis, and shown in a tabular...
Neeraj Sangal, Ev Jordan, Vineet Sinha, Daniel Jac...
PODS
2004
ACM
130views Database» more  PODS 2004»
15 years 9 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
EC
2000
241views ECommerce» more  EC 2000»
14 years 9 months ago
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
To successfully apply evolutionary algorithms to the solution of increasingly complex problems, we must develop effective techniques for evolving solutions in the form of interact...
Mitchell A. Potter, Kenneth A. De Jong
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
73
Voted
TPLP
2010
115views more  TPLP 2010»
14 years 8 months ago
Towards closed world reasoning in dynamic open worlds
The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this p...
Martin Slota, João Leite