Sciweavers

8496 search results - page 305 / 1700
» Problem Solving and Complex Systems
Sort
View
NIPS
2001
15 years 8 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
EVOTING
2004
113views Hardware» more  EVOTING 2004»
15 years 8 months ago
Verifiability and Other Technical Requirements for Online Voting Systems
: When developing a catalogue of technical requirements for online voting systems to be used in legally ruled, non-parliamentary elections, major interdisciplinary problems arise w...
Nils Meißner, Volker Hartmann, Dieter Richte...
CIS
2008
Springer
15 years 8 months ago
A Near-Optimal Redundancy Allocation Strategy that Minimizes a System's Vulnerability to Hazardous Events and Malicious Attacks
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
Frank Yeong-Sung Lin, Po-Hao Tsang, Kun-Dao Jiang
ISAAC
2010
Springer
272views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
Akiyoshi Shioura
CCGRID
2003
IEEE
15 years 12 months ago
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
Kento Aida, Wataru Natsume, Yoshiaki Futakata