Sciweavers

10608 search results - page 396 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 4 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
BMCBI
2006
169views more  BMCBI 2006»
15 years 4 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
ICNS
2007
IEEE
15 years 10 months ago
DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
Changhua Sun, Lei Shi, Chengchen Hu, Bin Liu
INFORMATICALT
2010
138views more  INFORMATICALT 2010»
15 years 1 months ago
Recognition of Human Emotions in Reasoning Algorithms of Wheelchair Type Robots
This paper analyses the possibilities of integrating different technological and knowledge representation techniques for the development of a framework for the remote control of mu...
Dale Dzemydiene, Antanas Andrius Bielskis, Arunas ...
IJCAI
2007
15 years 5 months ago
Deictic Option Schemas
Deictic representation is a representational paradigm, based on selective attention and pointers, that allows an agent to learn and reason about rich complex environments. In this...
Balaraman Ravindran, Andrew G. Barto, Vimal Mathew