Sciweavers

2229 search results - page 287 / 446
» Comparative analysis of biclustering algorithms
Sort
View
ICOIN
2004
Springer
14 years 3 months ago
On Reducing Paging Cost in IP-Based Wireless/Mobile Networks
For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing expl...
Kyoungae Kim, Sangheon Pack, Yanghee Choi
HT
2003
ACM
14 years 3 months ago
Do adaptation rules improve web cost estimation?
Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorith...
Emilia Mendes, Nile Mosley, Steve Counsell
EMSOFT
2003
Springer
14 years 3 months ago
Rate Monotonic vs. EDF: Judgment Day
Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedu...
Giorgio C. Buttazzo
ATS
2000
IEEE
134views Hardware» more  ATS 2000»
14 years 2 months ago
Fsimac: a fault simulator for asynchronous sequential circuits
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper pre...
Susmita Sur-Kolay, Marly Roncken, Ken S. Stevens, ...
COMPULOG
1999
Springer
14 years 2 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh