Sciweavers

4488 search results - page 716 / 898
» Properties of NP-Complete Sets
Sort
View
AAAI
2000
15 years 7 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
AAAI
2000
15 years 7 months ago
Robust Combinatorial Auction Protocol against False-Name Bids
This paper presents a new combinatorial auction protocol (LDS protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commer...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
AIPS
2000
15 years 7 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
WISES
2003
15 years 7 months ago
Intelligent UART Module for Real-Time Applications
— More and more fieldbus applications require a communication with real-time properties, while still being economically feasible. The fieldbuses LIN and TTP/A take this require...
Martin Delvai, Ulrike Eisenmann, Wilfried Elmenrei...
WSCG
2003
123views more  WSCG 2003»
15 years 7 months ago
From Dupin Cyclides to Scaled Cyclides
Dupin cyclides are algebraic surfaces introduced for the first time in 1822 by the French mathematician Pierre-Charles Dupin. They have a low algebraic degree and have been propo...
Lionel Garnier, Sebti Foufou, Marc Neveu