Sciweavers

925 search results - page 103 / 185
» A Solution to the Extended GCD Problem
Sort
View
GD
2005
Springer
14 years 2 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 2 months ago
Multipopulation cooperative coevolutionary programming (MCCP) to enhance design innovation
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to sea...
Emily M. Zechman, S. Ranji Ranjithan
NMR
2004
Springer
14 years 2 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
EUROPAR
1998
Springer
14 years 1 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
ATAL
2009
Springer
14 years 1 months ago
Norm-based behaviour modification in BDI agents
While there has been much work on developing frameworks and models of norms and normative systems, consideration of the impact of norms on the practical reasoning of agents has at...
Felipe Rech Meneguzzi, Michael Luck