Sciweavers

3656 search results - page 27 / 732
» Compact Location Problems
Sort
View
JSCIC
2010
178views more  JSCIC 2010»
13 years 4 months ago
A Compact Fourth Order Scheme for the Helmholtz Equation in Polar Coordinates
In many problems, one wishes to solve the Helmholtz equation in cylindrical or spherical coordinates which introduces variable coefficients within the differentiated terms. Fourth ...
S. Britt, S. Tsynkov, Eli Turkel
CSMR
2005
IEEE
14 years 3 months ago
Correlating Features and Code Using a Compact Two-Sided Trace Analysis Approach
Software developers are constantly required to modify and adapt application features in response to changing requirements. The problem is that just by reading the source code, it ...
Orla Greevy, Stéphane Ducasse
SODA
2003
ACM
139views Algorithms» more  SODA 2003»
13 years 11 months ago
Compact representations of separable graphs
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
AIPS
2008
14 years 5 days ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
PODC
2006
ACM
14 years 3 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...