1763 search results - page 117 / 353 » A Formalization of Polytime Functions |
JAIR
2007
14 years 9 months ago
2007
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
TLDI
2009
ACM
15 years 6 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
TBILLC
2005
Springer
15 years 3 months ago
2005
Springer
Structuring of information proceeds through the foregrounding of certain parts of the information. In general, foregrounding can be realized on various linguistic levels and it is...
ATAL
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this paper, we consider the issue of designing agents that successfully balance the amount of time spent in reconsidering their intentions against the amount of time s...