Sciweavers

5210 search results - page 275 / 1042
» Exact geometric computation
Sort
View
EXACT
2008
15 years 9 months ago
Explaining recommendations generated by MDPs
There has been little work in explaining recommendations generated by Markov Decision Processes (MDPs). We analyze the difculty of explaining policies computed automatically and id...
Omar Zia Khan, Pascal Poupart, James P. Black
CORR
1999
Springer
84views Education» more  CORR 1999»
15 years 6 months ago
Finding an ordinary conic and an ordinary hyperplane
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
Olivier Devillers, Asish Mukhopadhyay
FCS
2009
15 years 4 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
DAM
2011
15 years 1 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
TON
2010
168views more  TON 2010»
15 years 1 months ago
Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...
Jun Luo, Catherine Rosenberg, André Girard