Sciweavers

7773 search results - page 147 / 1555
» On generalized Frame-Stewart numbers
Sort
View
IJCAI
1989
14 years 11 months ago
Acquiring Recursive Concepts with Explanation-Based Learning
Explanation-based generalization algorithms need to generalize the structure of their explanations. This is necessary in order to acquire concepts where a recursive or iterative p...
Jude W. Shavlik
FOCS
2009
IEEE
15 years 4 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ASMTA
2009
Springer
104views Mathematics» more  ASMTA 2009»
15 years 4 months ago
Preliminary Results on a Simple Approach to G/G/c-Like Queues
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
Alexandre Brandwajn, Thomas Begin
DM
2006
104views more  DM 2006»
14 years 10 months ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
DCG
2007
104views more  DCG 2007»
14 years 10 months ago
Coincidence Site Modules in 3-Space
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, ...
Michael Baake, Peter A. B. Pleasants, Ulf Rehmann