Sciweavers

2446 search results - page 119 / 490
» First Smart Spaces
Sort
View
115
Voted
CCCG
2006
15 years 5 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
126
Voted
AAAI
2010
15 years 3 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
TNN
2010
147views Management» more  TNN 2010»
14 years 10 months ago
State-space analysis of Boolean networks
This paper provides a comprehensive framework for the state space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor produ...
Daizhan Cheng, Hongsheng Qi
137
Voted
BMCBI
2010
117views more  BMCBI 2010»
15 years 3 months ago
Beyond rotamers: a generative, probabilistic model of side chains in proteins
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...
138
Voted
PPSN
2010
Springer
15 years 1 months ago
Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
Tamara Ulrich, Johannes Bader, Lothar Thiele