Sciweavers

583 search results - page 93 / 117
» Finding Answers to Complex Questions
Sort
View
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 5 months ago
Soft Control on Collective Behavior of a Group of Autonomous Agents by a Shill Agent
This paper asks a new question: how can we control the collective behavior of self-organized multi-agent systems? We try to answer the question by proposing a new notion called `So...
Jing Han, Ming Li, Lei Guo
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
CEC
2009
IEEE
14 years 2 months ago
Task decomposition and evolvability in intrinsic evolvable hardware
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
Tüze Kuyucu, Martin Trefzer, Julian Francis M...
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 1 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang