365 search results - page 73 / 73 » Using Types as Approximations for Type Checking Prolog Progr... |
USS
2010
13 years 3 months ago
2010
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
ISBI
2008
IEEE
14 years 6 months ago
2008
IEEE
We propose a system for identification of germ layer components in teratomas derived from human and nonhuman primate embryonic stem cells. Tissue regeneration and repair, drug tes...
CP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...