Sciweavers

589 search results - page 24 / 118
» Introducing Dynamic Constraints in B
Sort
View
HICSS
2009
IEEE
108views Biometrics» more  HICSS 2009»
16 years 1 months ago
Approximate Dynamic Programming in Knowledge Discovery for Rapid Response
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
Peter Frazier, Warren B. Powell, Savas Dayanik, Pa...
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin
POPL
2011
ACM
14 years 9 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
GRID
2004
Springer
15 years 12 months ago
A Stochastic Control Model for Deployment of Dynamic Grid Services
We introduce a formal model for deployment and hosting of a dynamic grid service wherein the service provider must pay a resource provider for the use of computational resources. ...
Darin England, Jon B. Weissman
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
16 years 2 days ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...