Sciweavers

1237 search results - page 106 / 248
» Abstract shade trees
Sort
View
136
Voted
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 9 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
ICLP
1992
Springer
15 years 9 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 8 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
15 years 6 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
129
Voted
SCAM
2003
IEEE
15 years 10 months ago
XOgastan: XML-Oriented gcc AST Analysis and Transformations
Software maintenance, program analysis and transformation tools almost always rely on static source code analysis as the first and fundamental step to gather information. In the ...
Giuliano Antoniol, Massimiliano Di Penta, Gianluca...