Sciweavers

2519 search results - page 379 / 504
» Reasoning with Textual Cases
Sort
View
LICS
2003
IEEE
15 years 10 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
TPHOL
2003
IEEE
15 years 10 months ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
WCRE
2003
IEEE
15 years 10 months ago
Detecting Merging and Splitting using Origin Analysis
Merging and splitting source code artifacts is a common activity during the lifespan of a software system; as developers rethink the essential structure of a system or plan for a ...
Lijie Zou, Michael W. Godfrey
WECWIS
2003
IEEE
128views ECommerce» more  WECWIS 2003»
15 years 10 months ago
PCFinder: An Intelligent Product Recommendation Agent for E-Commerce
There are many e-commerce applications on the web. A common shortcoming is the lack of customer service and marketing analysis tools in most ecommerce web sites. In order to overc...
Bin Xiao, Esma Aïmeur, José Manuel Fer...
130
Voted
SPAA
2003
ACM
15 years 9 months ago
Nonblocking k-compare-single-swap
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
Victor Luchangco, Mark Moir, Nir Shavit