Sciweavers

245 search results - page 49 / 49
» Efficient Solving of Time-dependent Answer Set Programs
Sort
View
MOBIHOC
2005
ACM
14 years 4 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
RIVF
2008
13 years 6 months ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...
IASTEDSE
2004
13 years 6 months ago
A symbolic Java virtual machine for test case generation
Quality management is becoming a more and more important part of the software development process. As software testing is currently understood as the core function of the quality ...
Roger A. Müller, Christoph Lembeck, Herbert K...
JGS
2006
154views more  JGS 2006»
13 years 5 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis
ANOR
2005
160views more  ANOR 2005»
13 years 5 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...