Sciweavers

1568 search results - page 41 / 314
» The problem of examination questions in algorithmics
Sort
View
WSC
1997
14 years 11 months ago
Efficient Simulation of Multiclass Queueing Networks
General multiclass queueing systems are extremely difficult to analyze. A great deal of effort has been devoted to examining the question of stability and performance of such net...
Shane G. Henderson, Sean P. Meyn
IJCAI
2007
14 years 11 months ago
Some Effects of a Reduced Relational Vocabulary on the Whodunit Problem
A key issue in artificial intelligence lies in finding the amount of input detail needed to do successful learning. Too much detail causes overhead and makes learning prone to ove...
Daniel T. Halstead, Kenneth D. Forbus
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
15 years 7 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
14 years 10 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
CSB
2004
IEEE
124views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Multiple RNA Structure Alignment
RNA structures can be viewed as a kind of special strings with some characters bonded with each other. The question of aligning two RNA structures has been studied for a while, an...
Zhuozhi Wang, Kaizhong Zhang