Sciweavers

12597 search results - page 2304 / 2520
» Complexity of Mechanism Design
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 8 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
SPAA
1997
ACM
15 years 8 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
IUI
1993
ACM
15 years 8 months ago
Reducing user effort in collaboration support
incompatibility. We introduce Mona, an operational email system embodying this automatic approach. Mona establishes conversation context independently of user actions through the ...
Andy Cockburn, Harold W. Thimbleby
ACSAC
2007
IEEE
15 years 8 months ago
Distributed Secure Systems: Then and Now
The early 1980s saw the development of some rather sophisticated distributed systems. These were not merely networked file systems: rather, using remote procedure calls, hierarchi...
Brian Randell, John M. Rushby
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 8 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
« Prev « First page 2304 / 2520 Last » Next »