Sciweavers

1887 search results - page 281 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ATAL
2003
Springer
14 years 1 months ago
Towards a motivation-based approach for evaluating goals
Traditional goal-oriented approaches to building intelligent agents only consider absolute satisfaction of goals. However, in continuous domains there may be many instances in whi...
Stephen J. Munroe, Michael Luck, Mark d'Inverno
ECML
2003
Springer
14 years 1 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
ASYNC
1999
IEEE
110views Hardware» more  ASYNC 1999»
14 years 6 days ago
Verification of Delayed-Reset Domino Circuits Using ATACS
This paper discusses the application of the timing analysis tool ATACS to the high performance, self-resetting and delayed-reset domino circuits being designed at IBM's Austi...
Wendy Belluomini, Chris J. Myers, H. Peter Hofstee
FSTTCS
2010
Springer
13 years 5 months ago
Expressiveness of streaming string transducers
Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and us...
Rajeev Alur, Pavol Cerný
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad