Sciweavers

7773 search results - page 14 / 1555
» On generalized Frame-Stewart numbers
Sort
View
FOCS
1999
IEEE
13 years 12 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 1 months ago
Reducing the number of transistors in digital circuits using gate-level evolutionary design
This paper shows that the evolutionary design of digital circuits which is conducted at the gate level is able to produce human-competitive circuits at the transistor level. In ad...
Zbysek Gajda, Lukás Sekanina
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary selection of minimum number of features for classification of gene expression data using genetic algorithms
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
Alper Küçükural, Reyyan Yeniterzi...
CHI
1999
ACM
13 years 12 months ago
The Hotbox: Efficient Access to a Large Number of Menu-Items
The proliferation of multiple toolbars and UI widgets around the perimeter of application windows is an indication that the traditional GUI design of a single menubar is not suffi...
Gordon Kurtenbach, George W. Fitzmaurice, Russell ...
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian