Sciweavers

400 search results - page 73 / 80
» Backtracking
Sort
View
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 2 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
ATAL
2007
Springer
14 years 2 months ago
Modelling the provenance of data in autonomous systems
Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be...
Simon Miles, Steve Munroe, Michael Luck, Luc Morea...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 2 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
IMC
2006
ACM
14 years 2 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan