Sciweavers

16430 search results - page 139 / 3286
» On Computable Tree Functions
Sort
View
122
Voted
COCOON
2006
Springer
15 years 7 months ago
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
Sheung-Hung Poon
160
Voted
BMCBI
2010
143views more  BMCBI 2010»
15 years 3 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
110
Voted
ISSAC
1994
Springer
119views Mathematics» more  ISSAC 1994»
15 years 7 months ago
Branch Cuts in Computer Algebra
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
Adam Dingle, Richard J. Fateman
120
Voted
ICNP
1998
IEEE
15 years 7 months ago
On-Demand Multicast in Mobile Wireless Networks
In this paper we propose an "on demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on...
Ching-Chuan Chiang, Mario Gerla
148
Voted
ECAI
2004
Springer
15 years 9 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...