Sciweavers

1381 search results - page 134 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
ESANN
2003
15 years 5 months ago
Developmental pruning of synapses and category learning
After an initial peak, the number of synapses in mammalian cerebral cortex decreases in the formative period and throughout adult life. However, if synapses are taken to reflect ci...
Roberto Viviani, Manfred Spitzer
WG
2005
Springer
15 years 9 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
CORR
2002
Springer
136views Education» more  CORR 2002»
15 years 4 months ago
Libra: An Economy driven Job Scheduling System for Clusters
Clusters of computers have emerged as mainstream parallel and distributed platforms for high-performance, highthroughput and high-availability computing. To enable effective resou...
Jahanzeb Sherwani, Nosheen Ali, Nausheen Lotia, Za...
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
16 years 4 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 8 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li