Sciweavers

2157 search results - page 336 / 432
» Binary ant algorithm
Sort
View
105
Voted
ICML
2000
IEEE
16 years 3 months ago
Discovering Test Set Regularities in Relational Domains
Machine learning typically involves discovering regularities in a training set, then applying these learned regularities to classify objects in a test set. In this paper we presen...
Seán Slattery, Tom M. Mitchell
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 3 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
104
Voted
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 2 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
142
Voted
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
16 years 17 hour ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
119
Voted
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 12 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...