16091 search results - page 439 / 3219 » Solving |
197
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
169
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
175
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
155
click to vote
CVPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Layer decomposition from a single image is an underconstrained problem, because there are more unknowns than equations. This paper studies a slightly easier but very useful altern...
169
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The Web is a vibrant environment for innovation in computer science, AI, and social interaction; these innovations come in such great number and speed that it is unlikely...