Sciweavers

3656 search results - page 361 / 732
» Compact Location Problems
Sort
View
AIPS
2009
15 years 7 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
CGF
2008
80views more  CGF 2008»
15 years 6 months ago
A Semi-Lagrangian CIP Fluid Solver without Dimensional Splitting
In this paper, we propose a new constrained interpolation profile (CIP) method that is stable and accurate but requires less amount of computation compared to existing CIP-based s...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko
TMC
2002
118views more  TMC 2002»
15 years 6 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
BMCBI
2011
14 years 10 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
CORR
2011
Springer
222views Education» more  CORR 2011»
14 years 10 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh