461 search results - page 10 / 93 » Fundamentals of concern manipulation |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
IIE
2007
13 years 7 months ago
2007
Abstract. Issues related to 3d turtle’s navigation and geometrical figures’ manipulation in the simulated 3d space of a newly developed computational environment, MaLT, are re...
ASE
2006
13 years 7 months ago
2006
Recently, more attention is paid to the researches and practices on how to use software architecture in software maintenance and evolution to reduce their complexity and cost. The ...
IVA
2005
Springer
14 years 1 months ago
2005
Springer
If intelligent virtual agents are to become widely adopted it is vital that they can be designed using the user friendly graphical tools that are used in other areas of graphics. H...
IJCAI
2003
13 years 9 months ago
2003
Compilability is a fundamental property of knowledge representation formalisms which captures how succinctly information can be expressed. Although many results concerning compila...