Sciweavers

240 search results - page 34 / 48
» The Tree Inclusion Problem: In Optimal Space and Faster
Sort
View
AI
2002
Springer
13 years 8 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
TNN
2010
185views Management» more  TNN 2010»
13 years 2 months ago
An adaptive multiobjective approach to evolving ART architectures
In this paper, we present the evolution of adaptive resonance theory (ART) neural network architectures (classifiers) using a multiobjective optimization approach. In particular, w...
Assem Kaylani, Michael Georgiopoulos, Mansooreh Mo...
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
14 years 2 months ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
ICALP
2007
Springer
13 years 12 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan