Sciweavers

325 search results - page 23 / 65
» Extending an Algebraic Modeling Language to Support Constrai...
Sort
View
STACS
1999
Springer
13 years 12 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
RULES
1993
Springer
159views Database» more  RULES 1993»
13 years 11 months ago
Implementing Relationships and Constraints in an Object-Oriented Database Using a Monitor Construct
Semantic models have shown the utility of arbitrary user-de ned relationships for de ning the semantics of database information, while objectoriented models have developed a stron...
Michael Doherty, Joan Peckham, Victor Fay Wolfe
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 6 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
TLDI
2003
ACM
110views Formal Methods» more  TLDI 2003»
14 years 28 days ago
Type-safe multithreading in cyclone
We extend Cyclone, a type-safe polymorphic language at vel of abstraction, with threads and locks. Data races can violate type safety in Cyclone. An extended type system staticall...
Dan Grossman
IJCAI
2001
13 years 9 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson