Sciweavers

12373 search results - page 2473 / 2475
» Semi-Logarithmic Number Systems
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 7 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ALIFE
2000
13 years 7 months ago
Talking Helps: Evolving Communicating Agents for the Predator-Prey Pursuit Problem
We analyze a general model of multi-agent communication in which all agents communicate simultaneously to a message board. A genetic algorithm is used to evolve multi-agent languag...
Kam-Chuen Jim, C. Lee Giles
BMCBI
2002
137views more  BMCBI 2002»
13 years 7 months ago
ORFer - retrieval of protein sequences and open reading frames from GenBank and storage into relational databases or text files
Background: Functional genomics involves the parallel experimentation with large sets of proteins. This requires management of large sets of open reading frames as a prerequisite ...
Konrad Büssow, Steve Hoffmann, Volker Sievert
CCR
2002
130views more  CCR 2002»
13 years 7 months ago
Network topologies, power laws, and hierarchy
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Interne...
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Ja...
« Prev « First page 2473 / 2475 Last » Next »