Sciweavers

3471 search results - page 159 / 695
» Obstacle Numbers of Graphs
Sort
View
RE
1999
Springer
15 years 8 months ago
Requirements Engineering, Expectations Management, and the Two Cultures
One of the difficulties in requirements negotiation is to determine a feasible and mutually satisfactory set of requirements for the developer and the user, a problem related to C...
Barry W. Boehm, Marwan Abi-Antoun, Daniel Port, Ju...
CRW
1998
Springer
332views Robotics» more  CRW 1998»
15 years 8 months ago
Communication in Domains with Unreliable, Single-Channel, Low-Bandwidth Communication
In most multiagent systems with communicating agents, the agents have the luxury of using reliable, multi-step negotiation protocols. They can do so primarily when communication i...
Peter Stone, Manuela M. Veloso
IGPL
2006
130views more  IGPL 2006»
15 years 4 months ago
Verifying Temporal Heap Properties Specified via Evolution Logic
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard...
ISCI
2007
88views more  ISCI 2007»
15 years 4 months ago
Strategy creation, decomposition and distribution in particle navigation
Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-ba...
Ulas Beldek, Kemal Leblebicioglu
JIRS
2007
108views more  JIRS 2007»
15 years 4 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami