Sciweavers

3406 search results - page 84 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
TAPSOFT
1997
Springer
14 years 9 days ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
EDBT
2000
ACM
13 years 11 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
CORR
2011
Springer
157views Education» more  CORR 2011»
12 years 12 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
ICASSP
2010
IEEE
13 years 8 months ago
Adaptive search for sparse targets with informative priors
ACT This works considers the problem of efficient energy allocation of resources in a continuous fashion in determining the location of targets in a sparse environment. We extend ...
Gregory Newstadt, Eran Bashan, Alfred O. Hero III
SPAA
2005
ACM
14 years 1 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski