Sciweavers

6142 search results - page 350 / 1229
» The Complexity of Partition Functions
Sort
View
AAAI
2010
15 years 8 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
DSD
2010
IEEE
161views Hardware» more  DSD 2010»
15 years 6 months ago
Design of Trace-Based Split Array Caches for Embedded Applications
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...
Alice M. Tokarnia, Marina Tachibana
AAMAS
2010
Springer
15 years 6 months ago
Multi-goal economic search using dynamic search structures
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
David Sarne, Efrat Manisterski, Sarit Kraus
EOR
2007
110views more  EOR 2007»
15 years 6 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...
TKDE
2008
111views more  TKDE 2008»
15 years 6 months ago
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
Sanghamitra Bandyopadhyay, Sriparna Saha