Sciweavers

342 search results - page 31 / 69
» Constrained Integer Partitions
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 26 days ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
JAIR
2010
77views more  JAIR 2010»
13 years 7 months ago
Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
Because an agent’s resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such a...
E. H. Durfee Wu, Edmund H. Durfee
MCS
2001
Springer
14 years 29 days ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
CP
2005
Springer
14 years 2 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
TOCS
2002
70views more  TOCS 2002»
13 years 8 months ago
Secure program partitioning
This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untruste...
Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom,...