Sciweavers

345 search results - page 66 / 69
» Computer-Assisted Simulation Proofs
Sort
View
CP
2005
Springer
15 years 3 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
15 years 2 months ago
Localized techniques for broadcasting in wireless sensor networks
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
PATAT
2004
Springer
130views Education» more  PATAT 2004»
15 years 2 months ago
Learning User Preferences in Distributed Calendar Scheduling
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
Jean Oh, Stephen F. Smith
FOCS
2003
IEEE
15 years 2 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
INFOCOM
2002
IEEE
15 years 2 months ago
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
Paolo Giaccone, Balaji Prabhakar, Devavrat Shah