Sciweavers

1959 search results - page 129 / 392
» Designing for spatial competence
Sort
View
DAC
1999
ACM
16 years 7 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
ICML
2006
IEEE
16 years 7 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
ICSE
2003
IEEE-ACM
16 years 6 months ago
An Empirical Study of an Informal Knowledge Repository in a Medium-Sized Software Consulting Company
Numerous studies have been conducted on design and architecture of knowledge repositories. This paper addresses the need for looking at practices where knowledge repositories are ...
Emil Røyrvik, Torgeir Dingsøyr
HICSS
2009
IEEE
105views Biometrics» more  HICSS 2009»
16 years 1 months ago
Note Taking and Note Sharing While Browsing Campaign Information
Participants were observed while searching and browsing the internet for campaign information in a mock-voting situation in three online note-taking conditions: No Notes, Private ...
Scott P. Robertson, Ravi K. Vatrapu, George Abraha...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 23 days ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl