Sciweavers

4103 search results - page 419 / 821
» Some results on the Collatz problem
Sort
View
193
Voted
IM
2007
15 years 8 months ago
A decision support tool to optimize scheduling of IT changes
— Change management is one of the most critical processes in IT management. Some of the reasons are the sheer number of changes and the difficulty of evaluating the impact of cha...
Rodrigo Rebouças, Jacques Philippe Sauv&eac...
AAAI
2006
15 years 8 months ago
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
Rama Akkiraju, Biplav Srivastava, Anca-Andreea Iva...
IJCAI
2003
15 years 8 months ago
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number...
David Allen, Adnan Darwiche
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 8 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
CVPR
2010
IEEE
15 years 7 months ago
A probabilistic framework for joint segmentation and tracking
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
Chad Aeschliman, Johnny Park, Avinash C. Kak