Sciweavers

12950 search results - page 2323 / 2590
» On Optimal Timed Strategies
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 8 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
ECOOP
1998
Springer
15 years 8 months ago
Design and Partial Evaluation of Meta-Objects for a Concurrent Reflective Language
Customizable meta-objects are a powerful abstraction for extending language features and implementation mechanisms, but interpretive execution suffers from severe performance penal...
Hidehiko Masuhara, Akinori Yonezawa
ICALP
1998
Springer
15 years 8 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
HICSS
1997
IEEE
110views Biometrics» more  HICSS 1997»
15 years 8 months ago
Resource Management in the mpC Programming Environment
The mpC language was developed to write efJicientand portable programsfor wide range of distributed memory machines. It supports both task and data parallelism, allows both static...
Dmitry Arapov, Alexey Kalinov, Alexey L. Lastovets...
JELIA
1998
Springer
15 years 8 months ago
Towards State Update Axioms: Reifying Successor State Axioms
Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions--but only as far as its representational aspect is concerned. We show how by g...
Michael Thielscher
« Prev « First page 2323 / 2590 Last » Next »