1984 search results - page 237 / 397 » The colourful feasibility problem |
153
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
We investigate appropriate regimes for transmission line propagation of signals on digital integrated circuits. We start from exact solutions to the transmission line equations pr...
158
click to vote
CAV
2009
Springer
16 years 1 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
175
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
165
click to vote
ICECCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we introduce the model REMES for formal modeling and analysis of embedded resources such as storage, energy, communication, and computation. The model is a state-ma...
170
click to vote
WEBI
2009
Springer
16 years 1 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...