Sciweavers

2412 search results - page 395 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
AAMAS
2012
Springer
12 years 3 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
VLSID
1998
IEEE
116views VLSI» more  VLSID 1998»
13 years 12 months ago
Synthesis of Testable RTL Designs
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
C. P. Ravikumar, Sumit Gupta, Akshay Jajoo
FLAIRS
2008
13 years 10 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
BMCBI
2008
163views more  BMCBI 2008»
13 years 7 months ago
Gene Ontology term overlap as a measure of gene functional similarity
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
Meeta Mistry, Paul Pavlidis