Sciweavers

600 search results - page 98 / 120
» Problems and results in extremal combinatorics - II
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
14 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
ICIP
2010
IEEE
14 years 7 months ago
A hybrid fusion method of fingerprint identification for high security applications
Though fingerprint identification is widely used now, its imperfect performance for some high security applications, such as ATM, the access control of nuclear power stations and ...
Yilong Yin, Yanbin Ning, Zhiguo Yang
PEPM
2011
ACM
14 years 16 days ago
Adaptation-based programming in java
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
Tim Bauer, Martin Erwig, Alan Fern, Jervis Pinto
88
Voted
ICDCS
2011
IEEE
13 years 9 months ago
Intelligent Placement of Datacenters for Internet Services
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...
Iñigo Goiri, Kien Le, Jordi Guitart, Jordi ...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 2 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund