Sciweavers

7200 search results - page 226 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
DAC
2003
ACM
16 years 7 months ago
Checking satisfiability of a conjunction of BDDs
Procedures for Boolean satis ability most commonly work with Conjunctive Normal Form. Powerful SAT techniques based on implications and con icts can be retained when the usual CNF...
Robert F. Damiano, James H. Kukula
WG
2005
Springer
16 years 1 days ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov
GI
2004
Springer
15 years 12 months ago
Sensor Lifetime Using SendOnDelta
: Energy is a scarce resource in wireless field bus systems. Strategies for power saving while coping with the application task are needed. This paper introduces the sendOnDelta-p...
Mario Neugebauer, Klaus Kabitzsch
ISIM
2007
15 years 8 months ago
Notes on Restricted P Colonies
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
Lucie Ciencialová, Ludek Cienciala
DAC
2008
ACM
16 years 7 months ago
Scan chain clustering for test power reduction
An effective technique to save power during scan based test is to switch off unused scan chains. The results obtained with this method strongly depend on the mapping of scan flip-...
Christian G. Zoellin, Hans-Joachim Wunderlich, Jen...