Sciweavers

9842 search results - page 325 / 1969
» Problem complexity
Sort
View
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
16 years 1 months ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
16 years 25 days ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
IEAAIE
2001
Springer
15 years 11 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 11 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
DOCENG
2008
ACM
15 years 8 months ago
Keeping a digital library clean: new solutions to old problems
Digital Libraries are complex information systems that involve rich sets of digital objects and their respective metadata, along with multiple organizational structures and servic...
Alberto H. F. Laender, Marcos André Gon&cce...