Sciweavers

205 search results - page 29 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
ICCAD
2008
IEEE
129views Hardware» more  ICCAD 2008»
14 years 5 months ago
A capacitance solver for incremental variation-aware extraction
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
IJBC
2007
80views more  IJBC 2007»
13 years 8 months ago
Exact Approximations of omega Numbers
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
Cristian S. Calude, Michael J. Dinneen
WINET
2010
136views more  WINET 2010»
13 years 7 months ago
Analysis of the Bluetooth device discovery protocol
Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes f...
Goutam Chakraborty, Kshirasagar Naik, Debasish Cha...
BNCOD
2003
104views Database» more  BNCOD 2003»
13 years 10 months ago
External Sorting with On-the-Fly Compression
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
John Yiannis, Justin Zobel
PVLDB
2008
113views more  PVLDB 2008»
13 years 7 months ago
Rewriting procedures for batched bindings
Queries, or calls to stored procedures/user-defined functions are often invoked multiple times, either from within a loop in an application program, or from the where/select claus...
Ravindra Guravannavar, S. Sudarshan