Sciweavers

15860 search results - page 2951 / 3172
» Agent-Based Software Engineering
Sort
View
FSTTCS
2004
Springer
15 years 8 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
115
Voted
FSTTCS
2004
Springer
15 years 8 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
143
Voted
FSTTCS
2004
Springer
15 years 8 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
FSTTCS
2004
Springer
15 years 8 months ago
Learning Languages from Positive Data and a Finite Number of Queries
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
Sanjay Jain, Efim B. Kinber
FSTTCS
2004
Springer
15 years 8 months ago
Adaptive Stabilization of Reactive Protocols
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called adaptive if its recovery time is proportional to the numb...
Shay Kutten, Boaz Patt-Shamir
« Prev « First page 2951 / 3172 Last » Next »