Sciweavers

171 search results - page 23 / 35
» Efficient algorithms for interface timing verification
Sort
View
C3S2E
2010
ACM
15 years 3 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
110
Voted
BMCBI
2008
99views more  BMCBI 2008»
15 years 2 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey
CCE
2005
15 years 1 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
INTERFACES
2008
77views more  INTERFACES 2008»
15 years 1 months ago
Showcase Scheduling at Fred Astaire East Side Dance Studio
: The ballroom dancing showcases at Fred Astaire East Side Dance Studio in Manhattan are held at least twice a year and provide the students with an environment for socializing, pr...
Miguel A. Lejeune, Nevena Yakova
108
Voted
WWW
2007
ACM
16 years 2 months ago
Crawling multiple UDDI business registries
As Web services proliferate, size and magnitude of UDDI Business Registries (UBRs) are likely to increase. The ability to discover Web services of interest then across multiple UB...
Eyhab Al-Masri, Qusay H. Mahmoud