Sciweavers

32032 search results - page 6165 / 6407
» Verified programming in Guru
Sort
View
CP
2000
Springer
15 years 11 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 11 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
EDBT
2000
ACM
15 years 11 months ago
Persistent Client-Server Database Sessions
Database systems support recovery, providing high database availability. However, database applications may lose work because of a server failure. In particular, if a database serv...
Roger S. Barga, David B. Lomet, Thomas Baby, Sanja...
CGO
2010
IEEE
15 years 11 months ago
Umbra: efficient and scalable memory shadowing
Shadow value tools use metadata to track properties of application data at the granularity of individual machine instructions. These tools provide effective means of monitoring an...
Qin Zhao, Derek Bruening, Saman P. Amarasinghe
CHI
1999
ACM
15 years 11 months ago
i-LAND: An Interactive Landscape for Creativity and Innovation
We describe the i-LAND environment which constitutes an example of our vision of the workspaces of the future, in this case supporting cooperative work of dynamic teams with chang...
Norbert A. Streitz, Jörg Geißler, Torst...
« Prev « First page 6165 / 6407 Last » Next »