Sciweavers

5372 search results - page 294 / 1075
» complexity 2007
Sort
View
ISCAPDCS
2007
13 years 11 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
APIN
2006
136views more  APIN 2006»
13 years 9 months ago
Cell modeling with reusable agent-based formalisms
Biologists are building increasingly complex models and simulations of cells and other biological entities, and are looking at alternatives to traditional representations. Making ...
Ken Webb, Tony White
ILC
2007
Springer
14 years 3 months ago
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
Jacques Duparc, Alessandro Facchini
WCE
2007
13 years 10 months ago
Cost Effective Implementation of Asynchronous Two-Level Logic
- We proposed the cost effective (in sense of gate number) asynchronous two-level logic. It is based on AND-OR implementation of minimized logic functions. We formulated and proved...
Igor Lemberski
NIPS
2007
13 years 11 months ago
Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms
The peristimulus time histogram (PSTH) and its more continuous cousin, the spike density function (SDF) are staples in the analytic toolkit of neurophysiologists. The former is us...
Dominik Endres, Mike W. Oram, Johannes E. Schindel...