Sciweavers

533 search results - page 42 / 107
» A Very Mathematical Dilemma
Sort
View
ICCAD
1996
IEEE
86views Hardware» more  ICCAD 1996»
15 years 10 months ago
Polarized observability don't cares
A new method is presented to compute the exact observability don't cares (ODC) for multilevel combinational circuits. A new mathematical concept, called polarization, is intr...
Harm Arts, Michel R. C. M. Berkelaar, C. A. J. van...
WCNC
2010
IEEE
15 years 10 months ago
Selection of Repetition Codes for MAC in Vehicular Ad Hoc Networks
—In the context of vehicular safety and entertainment applications, we focus on the design of a reliable medium access control scheme. Each vehicle is willing to form a network a...
Ali Honarvar, Shahrokh Valaee
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 9 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 9 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
IWSSD
2000
IEEE
15 years 9 months ago
The Complexity of TRMCS-like Spiral Specification
Modern software is often constructed using "spiral specification"; i.e. the specification is a dynamic document that is altered by experience with the current version of...
Tim Menzies