Sciweavers

1066 search results - page 86 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
CSL
2010
Springer
14 years 11 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
EAAI
2006
123views more  EAAI 2006»
14 years 9 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 1 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
CVPR
2008
IEEE
15 years 12 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona
JHSN
2000
172views more  JHSN 2000»
14 years 9 months ago
Dynamic token bucket (DTB): a fair bandwidth allocation algorithm for high-speed networks
Fair allocation of available bandwidth to competing flows is a simple form of quality of service (QoS) that can be provided to customers in packet-switched networks. A number of p...
Jayakrishna Kidambi, Dipak Ghosal, Biswanath Mukhe...