Sciweavers

14897 search results - page 2962 / 2980
» Environment for statistical computing
Sort
View
JSAC
2008
140views more  JSAC 2008»
14 years 10 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
KAIS
2006
126views more  KAIS 2006»
14 years 10 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
FUIN
2007
134views more  FUIN 2007»
14 years 9 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
NAR
2006
177views more  NAR 2006»
14 years 9 months ago
PUMA2 - grid-based high-throughput analysis of genomes and metabolic pathways
The PUMA2 system (available at http://compbio.mcs. 10 anl.gov/puma2) is an interactive, integrated bioinformatics environment for high-throughput genetic sequence analysis and met...
Natalia Maltsev, Elizabeth M. Glass, Dinanath Sula...
IIE
2007
125views more  IIE 2007»
14 years 9 months ago
Should LOGO Keep Going FORWARD 1?
LOGO has been evolving in incremental steps for 40 years. This has resulted in steady progress but some regions of the space of all programming languages for children cannot be re...
Ken Kahn
« Prev « First page 2962 / 2980 Last » Next »