Sciweavers

6939 search results - page 1092 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
FSTTCS
2009
Springer
15 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 10 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
ISQED
2005
IEEE
112views Hardware» more  ISQED 2005»
15 years 10 months ago
Two-Dimensional Layout Migration by Soft Constraint Satisfaction
Layout migration has re-emerged as an important task due to the increasing use of library hard intellectual properties. While recent advances of migration tools have accommodated ...
Qianying Tang, Jianwen Zhu
UIST
2005
ACM
15 years 10 months ago
PlayAnywhere: a compact interactive tabletop projection-vision system
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
Andrew D. Wilson
ATVA
2008
Springer
99views Hardware» more  ATVA 2008»
15 years 6 months ago
Model Checking Recursive Programs with Exact Predicate Abstraction
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
Arie Gurfinkel, Ou Wei, Marsha Chechik
« Prev « First page 1092 / 1388 Last » Next »