Sciweavers

8655 search results - page 1358 / 1731
» Challenges for Trusted Computing
Sort
View
GECCO
2009
Springer
15 years 7 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
CAISE
2004
Springer
15 years 7 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
127
Voted
CAV
2004
Springer
108views Hardware» more  CAV 2004»
15 years 7 months ago
Functional Dependency for Verification Reduction
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
Jie-Hong Roland Jiang, Robert K. Brayton
CIVR
2004
Springer
248views Image Analysis» more  CIVR 2004»
15 years 7 months ago
Automated Person Identification in Video
Abstract. We describe progress in the automatic detection and identification of humans in video, given a minimal number of labelled faces as training data. This is an extremely cha...
Mark Everingham, Andrew Zisserman
ATAL
2006
Springer
15 years 7 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
« Prev « First page 1358 / 1731 Last » Next »