Sciweavers

1941 search results - page 367 / 389
» On the Hardness of Approximate Reasoning
Sort
View
MICRO
2007
IEEE
113views Hardware» more  MICRO 2007»
15 years 1 months ago
The High Cost of a Cheap Lesson
y abstract, it is grounded in the experience of many markets. As I will illustrate, it explains much strategic behavior. Information spreads With a bit of effort, any technically s...
Shane Greenstein
IJCV
2010
194views more  IJCV 2010»
15 years 11 days ago
Extended Phase Field Higher-Order Active Contour Models for Networks - Its Application to Road Network Extraction from VHR Satel
This paper addresses the segmentation from an image of entities that have the form of a ‘network’, i.e. the region in the image corresponding to the entity is composed of bran...
Ting Peng, Ian H. Jermyn, Véronique Prinet,...
SAT
2010
Springer
165views Hardware» more  SAT 2010»
15 years 9 days ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
TAOSD
2010
15 years 8 days ago
A Graph-Based Aspect Interference Detection Approach for UML-Based Aspect-Oriented Models
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
Selim Ciraci, Wilke Havinga, Mehmet Aksit, Christo...
OOPSLA
2010
Springer
14 years 11 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...