Sciweavers

315 search results - page 13 / 63
» Simple Distributed Weighted Matchings
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia
ACSD
2005
IEEE
153views Hardware» more  ACSD 2005»
14 years 1 months ago
BoPi - A Distributed Machine for Experimenting Web Services Technologies
BoPi is a programming language with a runtime support that allows the distribution and the execution of programs over the network. The language is a process calculus with XML valu...
Samuele Carpineti, Cosimo Laneve, Paolo Milazzo
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
MOBICOM
2000
ACM
14 years 2 hour ago
Distributed fair scheduling in a wireless LAN
—Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows ...
Nitin H. Vaidya, Paramvir Bahl, Seema Gupta
PODC
2006
ACM
14 years 1 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein