Sciweavers

1813 search results - page 181 / 363
» Instance Pruning Techniques
Sort
View
186
Voted
UM
2007
Springer
16 years 1 months ago
Eliciting Motivation Knowledge from Log Files Towards Motivation Diagnosis for Adaptive Systems
Motivation is well-known for its importance in learning and its influence on cognitive processes. Adaptive systems would greatly benefit from having a user model of the learner’s...
Mihaela Cocea, Stephan Weibelzahl
188
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
16 years 17 days ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
175
Voted
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
16 years 13 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
175
Voted
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
15 years 11 months ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
FCCM
1998
IEEE
148views VLSI» more  FCCM 1998»
15 years 11 months ago
JHDL - An HDL for Reconfigurable Systems
JHDL is a design tool for reconfigurable systems that allows designers to express circuit organizations that dynamically change over time in a natural way, using only standard pro...
Peter Bellows, Brad L. Hutchings