5100 search results - page 253 / 1020 » The Linear Complexity of a Graph |
120
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
137
click to vote
BROADNETS
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
151
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
125
click to vote
FM
2009
Springer
15 years 9 months ago
2009
Springer
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
141
click to vote
TACAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...